Search arXivSearch

arXiv · 2109.05706

Uniform simplicity for subgroups of piecewise continuous bijections of the unit interval

Abstract

Let $I=[0,1)$ and $\mathcal{PC}(I)$ [resp. $\mathcal{PC}^+(I)$] be the quotient group of the group of all piecewise continuous [resp. piecewise continuous and orientation preserving] bijections of $I$ by its normal subgroup consisting in elements with finite support (i.e. that are trivial except at possibly finitely many points). Unpublished Theorems of Arnoux ([Arn81b]) state that $\mathcal{PC}^+(I)$ and certain groups of interval exchanges are simple, their proofs are the purpose of the Appendix. Dealing with piecewise direct affine maps, we prove the simplicity of the group $\mathcal A^+(I)$ (see Definition 1.6). These results can be improved. Indeed, a group $G$ is uniformly simple if there exists a positive integer $N$ such that for any $f,\phi \in G\setminus\{Id\}$, the element $\phi$ can be written as a product of at most $N$ conjugates of $f$ or $f^{-1}$. We provide conditions which guarantee that a subgroup $G$ of $\mathcal{PC}(I)$ is uniformly simple. As Corollaries, we obtain that $\mathcal{PC}(I)$, $\mathcal{PC}^+(I)$, $PL^+ (\mathbb S^1)$, $\mathcal A(I)$, $\mathcal A^+(I)$ and some Thompson like groups included the Thompson group $T$ are uniformly simple.

Explore related subjects

Keep this discovery

BibTeXRIS

Nancy Guelman, Isabelle Liousse, Pierre Arnoux. 2021-09-13. Uniform simplicity for subgroups of piecewise continuous bijections of the unit interval. https://arxiv.org/abs/2109.05706

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