SearcharxivSearch

arXiv · 2602.10433

Depth of free-by-cyclic groups

Abstract

For a free group automorphism, we prove that its poset of attracting lamination orbits is a canonical invariant of the associated mapping torus. That is, if a free-by-cyclic group splits as a mapping torus in two different ways, then the corresponding automorphisms have isomorphic posets of lamination orbits. Further, we show that the lamination depth, the size of the largest chain in this poset, is a commensurability invariant of the free-by-cyclic group.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Spencer Dowdall, Yassine Guerch, Radhika Gupta, Jean Pierre Mutanguha, Caglar Uyanik. 2026-02-11. Depth of free-by-cyclic groups. https://arxiv.org/abs/2602.10433

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