An algorithm to detect full irreducibility by bounding the volume of periodic free factors

2014/02/28 by Clay, Matt, Mangahas, Johanna, Pettet, Alexandra
#20F65 #FOS: Mathematics #Geometric Topology (math.GT) #Group Theory (math.GR)

paper · doi:10.48550/arxiv.1402.7342

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.

Related

• Detection of fully irreducible automorphisms in generalized\n Baumslag-Solitar groups
• Explicit computation of the index of a positive outer automorphism of the free group
• Constructing and Classifying Fully Irreducible Outer Automorphisms of Free Groups
• Detecting fully irreducible automorphisms: a polynomial time algorithm. With an appendix by Mark C. Bell
• The expansion factors of an outer automorphism and its inverse