Simple groups, random generation and algorithms

Thumbnail

Event details

Date 15.09.2016
Hour 17:1518:15
Speaker Martin Liebeck (Imperial College London)
Location
Category Conferences - Seminars
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.

Links

Practical information

  • General public
  • Free

Organizer

  • CIB

Contact

  • Valérie Krier

Event broadcasted in

Share