BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Random generation without CFSG - Sean Eberhard (G-Research)
DTSTART:20190508T124500Z
DTEND:20190508T134500Z
UID:TALK124357@talks.cam.ac.uk
CONTACT:Aled Walker
DESCRIPTION:A well-known theorem of Dixon states that two random elements 
 of the alternating group generate almost surely. The best bounds in this t
 heorem 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\, an
 d if I have time I'll also try to say something about SL(n\, q) too.
LOCATION:MR4\, CMS\, Wilberforce Road\, Cambridge\, CB3 0WB
END:VEVENT
END:VCALENDAR