SearcharxivSearch

arXiv · 1701.08321

Groups of fast homeomorphisms of the interval and the ping-pong argument

Abstract

We adapt the Ping-Pong Lemma, which historically was used to study free products of groups, to the setting of the homeomorphism group of the unit interval. As a consequence, we isolate a large class of generating sets for subgroups of $\mathrm{Homeo}_+(I)$ for which certain finite dynamical data can be used to determine the marked isomorphism type of the groups which they generate. As a corollary, we will obtain a criteria for embedding subgroups of $\mathrm{Homeo}_+(I)$ into Richard Thompson's group $F$. In particular, every member of our class of generating sets generates a group which embeds into $F$ and in particular is not a free product. An analogous abstract theory is also developed for groups of permutations of an infinite set.

Explore related subjects

Keep this discovery

BibTeXRIS

Collin Bleak, Matthew G. Brin, Martin Kassabov, Justin Tatch Moore, Matthew C. B. Zaremsky. 2017-01-28. Groups of fast homeomorphisms of the interval and the ping-pong argument. https://arxiv.org/abs/1701.08321

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