SearcharxivSearch

arXiv · 2607.10961

Irreducible fast sets of bump homeomorphisms generate copies of Thompson's groups $F_n$

Abstract

A homeomorphism of an interval is a positive bump if its support is a single open interval on which it moves every point to the right. Choosing a fundamental domain $[m,b(m))$ for the action of a positive bump $b$ on its support splits the remainder of the support into two intervals, called the feet of $b$. A finite set of positive bumps is geometrically fast if fundamental domains can be chosen so that all the resulting feet are pairwise disjoint. The crossing graph of such a set has the bumps as its vertices, two bumps being adjacent whenever their supports overlap but are not nested, and the set is irreducible if its crossing graph is connected. We prove that for every $n\geq 2$, every group generated by an irreducible geometrically fast set of $n$ positive bumps is isomorphic to the $n$-ary Thompson group $F_n$. This answers the strong version of a problem posed by Brin and Zaremsky (Oberwolfach Rep. 15 (2018)).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gili Golan. 2026-07-12. Irreducible fast sets of bump homeomorphisms generate copies of Thompson's groups $F_n$. https://arxiv.org/abs/2607.10961

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