English

Uniform perfectness for Interval Exchange Transformations with or without Flips

Group Theory 2021-09-17 v2 Dynamical Systems

Abstract

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

Keywords

Cite

@article{arxiv.1910.08923,
  title  = {Uniform perfectness for Interval Exchange Transformations with or without Flips},
  author = {Nancy Guelman and Isabelle Liousse},
  journal= {arXiv preprint arXiv:1910.08923},
  year   = {2021}
}

Comments

Former arXiv:1910.0823 is completed and split as two parts: This one deals with commutator length for groups of IET with or without flips, we removed AIET sections, the title is changed: we replaced "bounded simplicity" by "uniform perfectness". This text will be published in Ann. Inst. Fourier but it also contains an extra appendix on involution length. The second part is arXiv:2109.05706

R2 v1 2026-06-23T11:48:53.119Z