SearcharxivSearch

arXiv · 2410.04788

On a family of finitely generated simple groups of homeomorphisms of the circle

Abstract

The notion of chain groups of homeomorphisms of $\mathbb{R}$ was introduced by Kim, Koberda and Lodha as a generalization of Thompson's group $F$. Subsequently, an $S^1$-version of chain groups, known as ring groups, has been studied. In this paper, we further study the simplicity of the commutator subgroups of ring groups. We show that a ring group with a prechain subgroup acting minimally on its support has a simple commutator subgroup. We also study isometric actions of ring groups on $\mathbb{R}$-trees. We give a construction of ring groups such that for every fixed point-free isometric action on an $\mathbb{R}$-tree, there exists an invariant line upon which the group acts by translations. In other words, such ring groups have property A$\mathbb{R}$. We also confirm that there exist uncountably many finitely generated simple groups in the group of orientation preserving homeomorphisms of $S^1$, which are commutator subgroups of ring groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Motoko Kato. 2024-10-07. On a family of finitely generated simple groups of homeomorphisms of the circle. https://arxiv.org/abs/2410.04788

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