Search arXivSearch

arXiv · 1306.5688

Tree-irreducible automorphisms of free groups

Abstract

We introduce a new class of automorphisms $\varphi$ of the non-abelian free group $F_N$ of finite rank $N \geq 2$ which contains all iwips (= fully irreducible automorphisms), but also any automorphism induced by a pseudo-Anosov homeomorphism of a surface with arbitrary many boundary components. More generally, there may be subgroups of $F_N$ of rank $\geq 2$ on which $\varphi$ restricts to the identity. We prove some basic facts about such {\em tree-irreducible} automorphisms, and show that, together with Dehn twist automorphisms, they are the natural basic building blocks from which any automorphism of $\FN$ can be constructed in a train track set-up. We then show: {\bf Theorem:} {\it Every tree-irreducible automorphism of $F_N$ has induced North-South dynamics on the Thurston compactification $\bar{\rm CV}_N$ of Outer space.} Finally, we define a "blow-up" construction on the vertices of a train track map, which, starting from iwips, produces tree-irreducible automorphisms which in general are not iwip.

Explore related subjects

Keep this discovery

BibTeXRIS

Martin Lustig. 2013-06-24. Tree-irreducible automorphisms of free groups. https://arxiv.org/abs/1306.5688

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