Algorithmic detectability of iwip automorphisms

preprint2013arXivOpen access

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

Explore this paper’s authors, topics and related work.

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Abstract