Algorithmic detectability of iwip automorphisms

Ilya Kapovich

Research output: Contribution to journalArticlepeer-review


We produce an algorithm that, given, φ ∈ out(FN), where N ≥ 2 decides whether or not φ is an irreducible with irreducible powers ('fully irreducible') automorphism.

Original languageEnglish (US)
Pages (from-to)279-290
Number of pages12
JournalBulletin of the London Mathematical Society
Issue number2
StatePublished - Apr 2014
Externally publishedYes

ASJC Scopus subject areas

  • Mathematics(all)

Cite this