BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Finitely generated simple left orderable groups\, commutator width
  and  orderable monsters - Yash Lodha (École polytechnique fédérale de 
 Lausanne)
DTSTART:20190510T124500Z
DTEND:20190510T134500Z
UID:TALK122512@talks.cam.ac.uk
CONTACT:Richard Webb
DESCRIPTION:In 1980 Rhemtulla asked whether there exist finitely generated
  simple left orderable groups. \n\nIn joint work with Hyde\, we construct 
 continuum many such examples (up to isomorphism)\, thereby resolving this 
 question. In recent joint work with Hyde\, Navas\, and Rivas\, we demonstr
 ate that among these examples are also so called "left orderable monsters"
 . This means that all their actions on the real line are of a certain desi
 rable dynamical type. This resolves Question 4 from Navas's 2018 ICM proce
 edings article concerning the existence of such groups. In this talk I wil
 l provide a brief introduction to these groups and their striking structur
 al properties.
LOCATION:CMS\, MR13
END:VEVENT
END:VCALENDAR
