SearcharxivSearch

arXiv · 2607.04038

Higman--Thompson groups $F_n$ all the way down

Abstract

We prove that for every $n\ge 2$ the Higman--Thompson group $F_n$ has a maximal subgroup of infinite index isomorphic to itself. In fact, we construct a chain of subgroups $F_n=H_0>H_1>H_2>\cdots$, all isomorphic to $F_n$ and with trivial intersection, such that for every $i$ the only subgroups of $F_n$ containing $H_i$ are $H_i,H_{i-1},\ldots,H_0=F_n$; in particular, each $H_{i+1}$ is maximal in $H_i$. We prove that for all $n\ge m\ge 2$, every closed maximal subgroup of $F_m$ isomorphic to $F_n$ arises from a homeomorphism between the $n$-ary and $m$-ary Cantor spaces given by a finite semi-synchronizing transducer--a variation of the synchronizing transducers of Bleak, Cameron, Maissel, Navas and Olukoya. We characterize the homeomorphisms of Cantor spaces conjugating $F_n$ into $F_m$ as the order-preserving or order-reversing rational homeomorphisms whose minimal transducer is semi-synchronizing. At the heart of the paper is a machinery bridging transducers and Stallings $2$-cores of subgroups, which reduces the conjugation of finitely generated closed subgroups by such homeomorphisms to an algorithmic procedure. As applications, we prove that Jones' ternary oriented subgroup $\vec F_3\le F_3$ is isomorphic to $F_4$, answering questions of Aiello, and that all known maximal subgroups of infinite index of Thompson's group $F$ which act minimally on $(0,1)$ are isomorphic to Higman--Thompson groups. That raises the problem of whether all maximal subgroups of infinite index of $F$ which act minimally on $(0,1)$ are isomorphic to Higman--Thompson groups. We briefly discuss related results regarding fast groups of homeomorphisms and maximal subgroups of Thompson groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Gili Golan. 2026-07-04. Higman--Thompson groups $F_n$ all the way down. https://arxiv.org/abs/2607.04038

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