pith. sign in

arxiv: 1605.07390 · v1 · pith:5NFTMRBOnew · submitted 2016-05-24 · 🧮 math.GR

When is a polynomially growing automorphism of F_n geometric ?

classification 🧮 math.GR
keywords algorithmautomorphismgrowingpolynomiallyresultssomealgorithmicanswer
0
0 comments X
read the original abstract

The main result of this paper is an algorithmic answer to the question raised in the title, up to replacing the given $\hat{\phi} \in Out(F_n)$ by a positive power. In order to provide this algorithm, it is shown that every polynomially growing automorphism $\hat \phi$ can be represented by an iterated Dehn twist on some graph-of-groups $\cal{G}$ with $\pi_1{\cal{G}} = F_n$. One then uses results of two previous papers \cite{KY01, KY02} as well as some classical results such as the Whitehead algorithm to prove the claim.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.