Algorithmic detectability of iwip automorphisms

TL;DR

This paper presents an algorithm that determines whether a given automorphism of a free group is fully irreducible, aiding in the classification of automorphisms in geometric group theory.

Contribution

The authors develop the first algorithm to decide if an automorphism in Out(F_N) is an iwip, advancing computational methods in group theory.

Findings

Algorithm successfully identifies iwip automorphisms

Efficient decision process for automorphism classification

Contributes to computational tools in geometric group theory

Abstract

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