BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Simple groups\, random generation and algorithms
DTSTART:20160915T171500
DTEND:20160915T181500
DTSTAMP:20260416T112000Z
UID:6fd33c35f391308da685f1df3b1093f6b54f5137a8b317767237bc55
CATEGORIES:Conferences - Seminars
DESCRIPTION:Martin Liebeck (Imperial College London)\nIf one picks two ele
 ments at random in a finite non-abelian simple group G (such as an alterna
 ting group)\, then these two elements will generate G with probability ten
 ding to 1 as the order of G tends to infinity. I will discuss this result 
 and variations\, and show how they connect with some basic questions conce
 rning the existence of algorithms that determine finite images of finitely
  presented groups. No specialist knowledge will be assumed.
LOCATION:BI A0 448 https://plan.epfl.ch/?room==BI%20A0%20448
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR