University of Cambridge > Talks.cam > Geometric Group Theory (GGT) Seminar > Finitely generated simple left orderable groups, commutator width and orderable monsters

Finitely generated simple left orderable groups, commutator width and orderable monsters

Add to your list(s) Download to your calendar using vCal

  • UserYash Lodha (École polytechnique fédérale de Lausanne)
  • ClockFriday 10 May 2019, 13:45-14:45
  • HouseCMS, MR13.

If you have a question about this talk, please contact Richard Webb.

This talk has been canceled/deleted

In 1980 Rhemtulla asked whether there exist finitely generated simple left orderable groups.

In 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 demonstrate 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 desirable dynamical type. This resolves Question 4 from Navas’s 2018 ICM proceedings article concerning the existence of such groups. In this talk I will provide a brief introduction to these groups and their striking structural properties.

This talk is part of the Geometric Group Theory (GGT) Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.

 

© 2006-2022 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity