SearcharxivSearch

arXiv · math/0507589

Free-group automorphisms, train tracks and the beaded decomposition

Abstract

We study the automorphisms ϕof a finitely generated free group F. Building on the train-track technology of Bestvina, Feighn and Handel, we provide a topological representative f:G\to G of a power of ϕthat behaves very much like the realization on the rose of a positive automorphism. This resemblance is encapsulated in the Beaded Decomposition Theorem which describes the structure of paths in G obtained by repeatedly passing to f-images of an edge and taking subpaths. This decomposition is the key to adapting our proof of the quadratic isoperimetric inequality for $F\rtimes_ϕ\mathbb Z$, with ϕpositive, to the general case. To illustrate the wider utility of our topological normal form, we provide a short proof that for every w in F, the function $n\mapsto |ϕ^n(w)|$ grows either polynomially or exponentially.

Explore related subjects

Keep this discovery

BibTeXRIS

Martin R. Bridson, Daniel Groves. 2006-07-28. Free-group automorphisms, train tracks and the beaded decomposition. https://arxiv.org/abs/math/0507589

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