Random generation without CFSG

Add to your list(s) Download to your calendar using vCal

• Sean Eberhard (G-Research)
• Wednesday 08 May 2019, 13:45-14:45
• MR4, CMS, Wilberforce Road, Cambridge, CB3 0WB.

If you have a question about this talk, please contact Aled Walker.

A well-known theorem of Dixon states that two random elements of the alternating group generate almost surely. The best bounds in this theorem depend on the classification of finite simple groups. Let’s see how well we can do without CFSG . I will say some things about why I care, and if I have time I’ll also try to say something about SL(n, q) too.

This talk is part of the Discrete Analysis Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Discrete Analysis Seminar
• Hanchen DaDaDash
• Interested Talks
• MR4, CMS, Wilberforce Road, Cambridge, CB3 0WB
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.