An algorithm to detect full irreducibility by bounding the volume of periodic free factors
classification
🧮 math.GR
math.GT
keywords
freealgorithmfactorsgroupperiodicautomorphismboundingchecked
read the original abstract
We provide an effective algorithm for determining whether an element of the outer automorphism group of a free group is fully irreducible. Our method produces a finite list which can be checked for periodic proper free factors.
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.