SearcharxivSearch

arXiv · 1901.03314

Uniformly perfect finitely generated simple left orderable groups

Abstract

We show that the finitely generated simple left orderable groups $G_{\rho}$ constructed by the first two authors in arXiv:1807.06478 are uniformly perfect - each element in the group can be expressed as a product of three commutators of elements in the group. This implies that the group does not admit any homogeneous quasimorphism. Moreover, any nontrivial action of the group on the circle, which lifts to an action on the real line, admits a fixed point. Most strikingly, it follows that the groups are examples of left orderable monsters, which means that any faithful action on the real line without a global fixed point is globally contracting. This answers Question 4 from the 2018 ICM proceedings article of the third author. (This question has also been answered simultaneously and independently, using completely different methods, by Matte Bon and Triestino in arXiv:1811.12256.) To prove our results, we provide a certain characterisation of elements of the group $G_{\rho}$ which is a useful new tool in the study of these examples.

Explore related subjects

Keep this discovery

BibTeXRIS

James Hyde, Yash Lodha, Andrés Navas, Cristóbal Rivas. 2019-01-10. Uniformly perfect finitely generated simple left orderable groups. https://doi.org/10.1017/etds.2019.59

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR