paper

Algorithmic detectability of iwip automorphisms

arXiv:1209.3732 · doi:10.1112/blms/bdt093

Abstract

We produce an algorithm that, given , where , decides wether or not is an iwip ("fully irreducible") automorphism.

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

References in corpus (2)

Cited by in corpus (7)