Papers
Topics
Authors
Recent
Search
2000 character limit reached

Ideal Whitehead Graphs in Out(F_r) II: The Complete Graph in Each Rank

Published 28 Jan 2013 in math.GR and math.GT | (1301.6645v2)

Abstract: We show how to construct, for each $r \geq 3$, an ageometric, fully irreducible $\phi\in Out(F_r)$ whose ideal Whitehead graph is the complete graph on $2r-1$ vertices. This paper is the second in a series of three where we show that precisely eighteen of the twenty-one connected, simplicial, five-vertex graphs are ideal Whitehead graphs of fully irreducible $\phi \in Out(F_3)$. The result is a first step to an $Out(F_r)$ version of the Masur-Smillie theorem proving precisely which index lists arise from singular measured foliations for pseudo-Anosov mapping classes. In this paper we additionally give a method for finding periodic Nielsen paths and prove a criterion for identifying representatives of ageometric, fully irreducible $\phi\in Out(F_r)$

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.