When is a polynomially growing automorphism of Fn geometric ?
Abstract
The main result of this paper is an algorithmic answer to the question raised in the title, up to replacing the given φ ∈ Out(Fn) by a positive power. In order to provide this algorithm, it is shown that every polynomially growing automorphism φ can be represented by an iterated Dehn twist on some graph-of-groups G with π1G = Fn. One then uses results of two previous papers KY01, KY02 as well as some classical results such as the Whitehead algorithm to prove the claim.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.