Algorithmic detectability of iwip automorphisms
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- September 2012
- DOI:
- 10.48550/arXiv.1209.3732
- arXiv:
- arXiv:1209.3732
- Bibcode:
- 2012arXiv1209.3732K
- Keywords:
-
- Mathematics - Group Theory;
- Mathematics - Geometric Topology;
- 20F65
- E-Print:
- final version, to appear in the Bulletin of London Math. Soc