English

Algorithmic detectability of iwip automorphisms

Group Theory 2014-03-18 v7 Geometric Topology

Abstract

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

Keywords

Cite

@article{arxiv.1209.3732,
  title  = {Algorithmic detectability of iwip automorphisms},
  author = {Ilya Kapovich},
  journal= {arXiv preprint arXiv:1209.3732},
  year   = {2014}
}

Comments

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

R2 v1 2026-06-21T22:06:42.220Z