University of Cambridge > Talks.cam > Discrete Analysis Seminar > Random generation without CFSG

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Random generation without CFSG

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Seminar time is 1pm BST in Room FW 11, Willam Gates Hall. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon HEP web page aggregator in person & via zoom

Other talks

Title to be confirmed CSaP Annual Cleevely Lecture 2026 Optimal metric and approximation of free boundary minimal surfaces Title abstract tbc Afternoon Break Coming soon
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity