SearcharxivSearch

arXiv · 2503.07532

Relative Free Splitting Complexes III: Stable Translation Lengths and Filling Paths

Abstract

This is the last of a three part work about relative free splitting complexes $\mathcal{FS}(\Gamma,\mathscr{A})$ and their actions by relative outer automorphism groups $\text{Out}(\Gamma;\mathscr{A})$. We obtain quantitative relations between the stable translation length $\tau_\phi$ and the relative train track dynamics of~$\phi \in \Out(\Gamma;\A)$. First, if $\phi$ has an orbit with diameter bounded below by a certain constant $\Omega(\Gamma;\mathscr{A}) \ge 1$ then $\phi$ has a filling attracting lamination. Also, there is a positive lower bound $\tau_\phi \ge A(\Gamma;\mathscr{A}) > 0$ amongst all $\phi$ which have a filling attracting lamination. Both proofs rely on a study of \emph{filling paths} in a free splitting. These results are all new even for $\text{Out}(F_n)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael Handel, Lee Mosher. 2025-03-10. Relative Free Splitting Complexes III: Stable Translation Lengths and Filling Paths. https://arxiv.org/abs/2503.07532

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