Algorithmic detectability of iwip automorphisms

Abstract

We produce an algorithm that, given $\varphi \in Out(F_N)$, where $N\ge 2$, decides wether or not $\varphi$ is an iwip ("fully irreducible") automorphism.

final version, to appear in the Bulletin of London Math. Soc

References in corpus (1)

• Free group automorphisms with many fixed points at infinity

Cited by in corpus (7)

• Dynamics on free-by-cyclic groups
• Lone Axes in Outer Space
• Dynamics of hyperbolic iwips
• A train track directed random walk on $Out(F_r)$
• Irreducible Nonsurjective Endomorphisms of $F_n$ are Hyperbolic
• Counting conjugacy classes of fully irreducibles: double exponential growth
• The Conjugacy Problem for $Out(F_3)$