SearcharxivSearch

arXiv · 2005.00164

Train Tracks on Graphs of Groups and Outer Automorphisms of Hyperbolic Groups

Abstract

Stallings remarked that an outer automorphism of a free group may be thought of as a subdivision of a graph followed by a sequence of folds. In this thesis, we prove that automorphisms of fundamental groups of graphs of groups satisfying this condition may be represented by irreducible train track maps in the sense of Bestvina-Handel (we allow collapsing invariant subgraphs). Of course, we construct relative train track maps as well. Along the way, we give a new exposition of the Bass-Serre theory of groups acting on trees, morphisms of graphs of groups, and foldings thereof. We produce normal forms for automorphisms of free products and extend an argument of Qing-Rafi to show that they are not quasi-geodesic. As an application, we answer affirmatively a question of Paulin: outer automorphisms of finitely-generated word hyperbolic groups satisfy a dynamical trichotomy generalizing the Nielsen-Thurston "periodic, reducible or pseudo-Anosov." At the end of the thesis we collect some open problems we find interesting.

Explore related subjects

Keep this discovery

BibTeXRIS

Rylee Alanza Lyman. 2020-05-01. Train Tracks on Graphs of Groups and Outer Automorphisms of Hyperbolic Groups. https://arxiv.org/abs/2005.00164

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