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

DOI10.1307/MMJ/1434731924MaRDI QIDQ494148zbMATH OpenOpenAlexFDO

Authors Matt T. Clay, Johanna Mangahas, Alexandra Pettet

Publication date 31 August 2015

Published in Michigan Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1402.7342, https://projecteuclid.org/euclid.mmj/1434731924

zbMATH Keywords

algorithmsouter automorphism groupsfinitely generated free groupsiwip automorphismsfully irreducible automorphismsirreducible outer automorphismsvolume bounds of subgroups

Mathematics Subject Classification ID

Free nonabelian groups (20E05) Automorphisms of infinite groups (20E36) Geometric group theory (20F65) Topological methods in group theory (57M07) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

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.

Recommendations

• Detecting Fully Irreducible Automorphisms: A Polynomial Time Algorithm
• Algorithmic detectability of iwip automorphisms.
• Detecting automorphic orbits in free groups.
• Algorithmic constructions of relative train track maps and CTs
• Twisting out fully irreducible automorphisms.

Cited in

(4)

• Detecting Fully Irreducible Automorphisms: A Polynomial Time Algorithm
• Irreducible Outer Automorphisms of a Free Group
• Algorithmic detectability of iwip automorphisms.
• Right-angled Artin groups as normal subgroups of mapping class groups

This page was built for publication: An algorithm to detect full irreducibility by bounding the volume of periodic free factors.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494148)