Algorithmic detectability of iwip automorphisms

@article{Kapovich2014AlgorithmicDO,
  title={Algorithmic detectability of iwip automorphisms},
  author={Ilya Kapovich},
  journal={Bulletin of The London Mathematical Society},
  year={2014},
  volume={46},
  pages={279-290}
}
  • Ilya Kapovich
  • Published 2014
  • Mathematics
  • Bulletin of The London Mathematical Society
  • 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. 
    Long turns, INP's and index for free group automorphisms
    5
    Cannon-Thurston fibers for iwip automorphisms of $F_N$
    12
    Counting Conjugacy Classes in $Out(F_N)$
    1
    Detecting Fully Irreducible Automorphisms: A Polynomial Time Algorithm
    5
    Fibered commensurability on $\mathrm{Out}(F_{n})$
    1
    On the fibers of the Cannon-Thurston map for free-by-cyclic groups
    4
    Digraphs and cycle polynomials for free-by-cyclic groups
    18

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 28 REFERENCES
    Hyperbolic automorphisms of free groups
    106
    Botany of irreducible automorphisms of free groups
    24
    Twisting Out Fully Irreducible Automorphisms
    25
    Automorphisms of Free Groups and Outer Space
    156
    Stallings foldings and the subgroup structure of free groups
    24