Algorithmic detectability of iwip automorphisms
Abstract
We produce an algorithm that, given φ∈ Out(FN), where N 2, decides wether or not φ is an iwip ("fully irreducible") automorphism.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.