SearcharxivSearch

arXiv · 2204.02456

Relations with a fixed interval exchange transformation

Abstract

We study the group of all interval exchange transformations (IETs). We show that for every IET $S$, there exists a dense open set of admissible IETs that share a relation with $S$. This is an extension of a result published by Dahmani, Fujiwara and Guirardel in 2013: the group generated by a generic pair of elements of IET([0;1[) is not free (assuming a suitable condition on the underlying permutation). Key words: interval exchange transformations, free group of rank 2, interval exchange transformations with flips.

Explore related subjects

Keep this discovery

BibTeXRIS

Magali Jay. 2022-04-05. Relations with a fixed interval exchange transformation. https://arxiv.org/abs/2204.02456

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