Bernoulli Lecture - Simple groups, random generation and algorithms   15 September 2016

17:15 - 18:15
Room : BI A0 448


Martin Liebeck, Imperial College London

If one picks two elements at random in a finite non-abelian simple group G (such as an alternating group), then these two elements will generate G with probability tending 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 concerning the existence of algorithms that determine finite images of finitely presented groups. No specialist knowledge will be assumed.
Name University Dates of visit
Martin Liebeck Imperial College London 15/09/2016 - 15/09/2016
Total Guests : 1
Name University Dates of visit
Total Guests : 0
Conference in Honor of the 70th Birthday of Tudor Ratiu, 20 to 24 July 2020.
Registration fees of CHF 50.- are mandatory for visits from 1 day to full attendance of the conference.
Cancellations and no-shows are not eligible for a refund.
I hereby agree to the conditions of the registration fees and to settling the amount by 28 February 2020.

Last Name
First Name
Zip Code