Algorithmic detectability of iwip automorphisms
classification
🧮 math.GR
math.GT
keywords
iwipalgorithmalgorithmicautomorphismautomorphismsdecidesdetectabilityfully
read the original abstract
We produce an algorithm that, given $\phi\in Out(F_N)$, where $N\ge 2$, decides wether or not $\phi$ is an iwip ("fully irreducible") automorphism.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.