University of Cambridge > > Discrete Analysis Seminar > Random generation without CFSG

Random generation without CFSG

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

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity