SearcharxivSearch

arXiv · 2211.05268

Finitely presented left orderable monsters

Abstract

A left orderable monster is a finitely generated left orderable group all of whose fixpoint-free actions on the line are proximal: the action is semiconjugate to a minimal action so that for every bounded interval $I$ and open interval $J$, there is a group element that sends $I$ into $J$. In his 2018 ICM address, Navas asked about the existence of left orderable monsters. By now there are several examples, all of which are finitely generated but not finitely presentable. We provide the first examples of left orderable monsters that are finitely presentable, and even of type $F_\infty$. The construction itself is elementary, and these groups satisfy several additional properties separating them from the previous examples: they are not simple, they act minimally on the circle, and they have an infinite-dimensional space of homogeneous quasimorphisms. Our construction is flexible enough that it produces infinitely many isomorphism classes of finitely presented (and type $F_{\infty}$) left orderable monsters.

Explore related subjects

Keep this discovery

BibTeXRIS

Francesco Fournier-Facio, Yash Lodha, Matthew C. B. Zaremsky. 2022-11-09. Finitely presented left orderable monsters. https://doi.org/10.1017/etds.2023.49

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