SearcharxivSearch

arXiv · 1910.08923

Uniform perfectness for Interval Exchange Transformations with or without Flips

Abstract

Let $\mathcal G$ be the group of all Interval Exchange Transformations. Results of Arnoux-Fathi ([Arn81b]), Sah ([Sah81]) and Vorobets ([Vor17]) state that $\mathcal G_0$ the subgroup of $\mathcal G$ generated by its commutators is simple. In [Arn81b], Arnoux proved that the group $\overline{\mathcal G}$ of all Interval Exchange Transformations with flips is simple. We establish that every element of $\overline{\mathcal G}$ has a commutator length not exceeding $6$. Moreover, we give conditions on $\mathcal G$ that guarantee that the commutator lengths of the elements of $\mathcal G_0$ are uniformly bounded, and in this case for any $g\in \mathcal G_0$ this length is at most $5$. As analogous arguments work for the involution length in $\overline{\mathcal G}$, we add an appendix whose purpose is to prove that every element of $\overline{\mathcal G}$ has an involution length not exceeding $12$.

Explore related subjects

Keep this discovery

BibTeXRIS

Nancy Guelman, Isabelle Liousse. 2019-10-20. Uniform perfectness for Interval Exchange Transformations with or without Flips. https://arxiv.org/abs/1910.08923

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