Search arXivSearch

arXiv · 1306.4712

Subgroup decomposition in $\text{Out}(F_n)$, Part III: Weak attraction theory

Abstract

This is the third in a series of four papers (with research announcement posted on this arXiv) that develop a decomposition theory for subgroups of $\text{Out}(F_n)$. In this paper, given an outer automorphism of $F_n$ and an attracting-repelling lamination pair, we study which lines and conjugacy classes in $F_n$ are weakly attracted to that lamination pair under forward and backward iteration respectively. For conjugacy classes, we prove Theorem F from the research annoucement, which exhibits a unique vertex group system called the "nonattracting subgroup system" having the property that the conjugacy classes it carries are characterized as those which are not weakly attracted to the attracting lamination under forward iteration, and also as those which are not weakly attracted to the repelling lamination under backward iteration. For lines in general, we prove Theorem G that characterizes exactly which lines are weakly attracted to the attracting lamination under forward iteration and which to the repelling lamination under backward iteration. We also prove Theorem H which gives a uniform version of weak attraction of lines. v3: Contains a stronger proof of Lemma 2.19 (part of the proof of Theorem G) for purposes of further applications.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael Handel, Lee Mosher. 2013-06-19. Subgroup decomposition in $\text{Out}(F_n)$, Part III: Weak attraction theory. https://arxiv.org/abs/1306.4712

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