COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
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 monstersAdd to your list(s) Download to your calendar using vCal
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. This talk is included in these lists:This talk is not included in any other list Note that ex-directory lists are not shown. |
Other listsApplied and Computational Analysis Graduate Seminar Combined TCM Seminars and TCM blackboard seminar listing Enterprise Tuesday 2016-2017Other talksSpace, a final fontier? Segmentation dynamics and diversity in an arthropod cell-based field From Kepler's optics to Spinoza's politics: Descartes' turn to the passions Neural competition accounts for differences in recognising and learning spoken words and pseudoword Population Medicine - Group Discussion Sir Richard Stone Annual Lecture 2019: Firms and Growth |