[Paper Review] Constructing and classifying fully irreducible outer automorphisms of free groups

Catherine Pfaff|arXiv (Cornell University)|Jan 1, 2012

Geometric and Algebraic Topology14 references13 citations

TL;DR

This paper classifies which of the 21 connected, loop-free, five-vertex graphs can arise as ideal Whitehead graphs of ageometric, fully irreducible outer automorphisms in Out(F₃). Using Bestvina-Feighn-Handel train track theory and attracting lamination theory, it proves exactly 18 such graphs exist, and provides a method to identify periodic Nielsen paths and construct representatives with specific graph structures.

ABSTRACT

The main theorem of this document emulates, in the context of Out(F_r) theory, a mapping class group theorem (by H. Masur and J. Smillie) that determines precisely which index lists arise from pseudo-Anosov mapping classes. Since the ideal Whitehead graph gives a finer invariant in the analogous setting of a fully irreducible outer automorphisms of free groups, we instead focus on determining which of the twenty-one connected, loop-free, five-vertex graphs are ideal Whitehead graphs of ageometric, fully irreducible outer automorphisms of free groups in rank three. Our main theorem accomplishes this by showing that there are precisely eighteen graphs arising as such. We also give a method for identifying certain complications called periodic Nielsen paths, prove the existence of conveniently decomposed representatives of ageometric, fully irreducible outer automorphisms of free groups having connected, (2r-1)-vertex ideal Whitehead graphs, and prove a criterion for identifying representatives of ageometric, fully irreducible outer automorphisms of free groups. The strategies we use for constructing fully irreducible outer automorphisms of free groups, as well as our identification and decomposition techniques, can be used to extend our main theorem, as they are valid in any rank. Our methods of proof rely primarily on Bestvina-Feighn-Handel train track theory and the theory of attracting laminations.

Motivation & Objective

• To determine which of the 21 connected, loop-free, five-vertex graphs can be realized as ideal Whitehead graphs of ageometric, fully irreducible outer automorphisms in rank three.
• To develop a method for detecting and analyzing periodic Nielsen paths in outer automorphisms of free groups.
• To prove the existence of conveniently decomposed representatives for ageometric, fully irreducible outer automorphisms with connected (2r−1)-vertex ideal Whitehead graphs.
• To establish a criterion for identifying representatives of ageometric, fully irreducible outer automorphisms in terms of their dynamical and combinatorial structure.
• To extend the classification to higher ranks using generalizable construction and decomposition techniques.

Proposed method

• Application of Bestvina-Feighn-Handel train track theory to analyze the dynamics of outer automorphisms in Out(F_r).
• Use of attracting lamination theory to study the asymptotic behavior of automorphisms and their associated ideal Whitehead graphs.
• Combinatorial analysis of connected, loop-free, five-vertex graphs to determine realizability as ideal Whitehead graphs.
• Construction of representatives of ageometric, fully irreducible outer automorphisms with specified ideal Whitehead graphs via controlled decomposition techniques.
• Identification of periodic Nielsen paths through structural and dynamical constraints derived from the train track and lamination frameworks.
• Development of a criterion for recognizing ageometric, fully irreducible outer automorphisms based on their graph-theoretic and dynamical invariants.

Experimental results

Research questions

• RQ1 Which of the 21 connected, loop-free, five-vertex graphs can occur as ideal Whitehead graphs of ageometric, fully irreducible outer automorphisms in Out(F₃)?
• RQ2 How can periodic Nielsen paths in outer automorphisms of free groups be systematically identified and analyzed?
• RQ3 Do ageometric, fully irreducible outer automorphisms in Out(F_r) admit representatives with connected (2r−1)-vertex ideal Whitehead graphs?
• RQ4 What combinatorial and dynamical criteria can be used to distinguish representatives of ageometric, fully irreducible outer automorphisms?
• RQ5 Can the construction and classification methods developed for rank three be generalized to higher ranks?

Key findings

• Exactly 18 out of the 21 connected, loop-free, five-vertex graphs can arise as ideal Whitehead graphs of ageometric, fully irreducible outer automorphisms in Out(F₃).
• A systematic method is provided for detecting periodic Nielsen paths in outer automorphisms of free groups.
• Ageometric, fully irreducible outer automorphisms in Out(F_r) exist with conveniently decomposed representatives whose ideal Whitehead graphs are connected and have (2r−1) vertices.
• A criterion is established for identifying representatives of ageometric, fully irreducible outer automorphisms based on their dynamical and graph-theoretic properties.
• The construction and decomposition techniques used in the paper are valid and generalizable to any rank r ≥ 3.
• The results are derived using foundational tools from train track theory and attracting lamination theory, confirming their robustness and applicability beyond rank three.