TY - JOUR
T1 - Detecting Fully Irreducible Automorphisms
T2 - A Polynomial Time Algorithm
AU - Kapovich, Ilya
AU - Bell, Mark C.
N1 - Funding Information:
Ilya Kapovich was supported by the NSF grant DMS-1405146.
Publisher Copyright:
© 2017, © 2017 Taylor & Francis Group, LLC.
PY - 2019/1/2
Y1 - 2019/1/2
N2 - In [Kapovich 14] we produced an algorithm for deciding whether or not an element ϕ ∈ Out(F N ) is an iwip (“fully irreducible”) automorphism. At several points that algorithm was rather inefficient as it involved some general enumeration procedures as well as running several abstract processes in parallel. In this article we refine the algorithm from [Kapovich 14] by eliminating these inefficient features, and also by eliminating any use of mapping class groups algorithms. Our main result is to produce, for any fixed N ⩾ 3, an algorithm which, given a topological representative f of an element ϕ of ϕ, decides in polynomial time in terms of the “size” of f, whether or not ϕ is fully irreducible. In addition, we provide a train-track criterion of being fully irreducible which covers all fully irreducible elements of (F N ), including both atoroidal and non-atoroidal ones. We also give an algorithm, alternative to that of Turner, for finding all the indivisible Nielsen paths in an expanding train-track map, and estimate the complexity of this algorithm. An Appendix by Mark Bell provides a polynomial upper bound, in terms of the size of the topological representative, on the complexity of the Bestvina–Handel algorithm[Bestvina and Handel 92] for finding either an irreducible train-track representative or a topological reduction.
AB - In [Kapovich 14] we produced an algorithm for deciding whether or not an element ϕ ∈ Out(F N ) is an iwip (“fully irreducible”) automorphism. At several points that algorithm was rather inefficient as it involved some general enumeration procedures as well as running several abstract processes in parallel. In this article we refine the algorithm from [Kapovich 14] by eliminating these inefficient features, and also by eliminating any use of mapping class groups algorithms. Our main result is to produce, for any fixed N ⩾ 3, an algorithm which, given a topological representative f of an element ϕ of ϕ, decides in polynomial time in terms of the “size” of f, whether or not ϕ is fully irreducible. In addition, we provide a train-track criterion of being fully irreducible which covers all fully irreducible elements of (F N ), including both atoroidal and non-atoroidal ones. We also give an algorithm, alternative to that of Turner, for finding all the indivisible Nielsen paths in an expanding train-track map, and estimate the complexity of this algorithm. An Appendix by Mark Bell provides a polynomial upper bound, in terms of the size of the topological representative, on the complexity of the Bestvina–Handel algorithm[Bestvina and Handel 92] for finding either an irreducible train-track representative or a topological reduction.
KW - Primary 20F65
KW - Secondary 57M, 37B, 37D
KW - automorphism
KW - free
KW - group
KW - track
KW - train
UR - http://www.scopus.com/inward/record.url?scp=85019750585&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85019750585&partnerID=8YFLogxK
U2 - 10.1080/10586458.2017.1326326
DO - 10.1080/10586458.2017.1326326
M3 - Article
AN - SCOPUS:85019750585
SN - 1058-6458
VL - 28
SP - 24
EP - 38
JO - Experimental Mathematics
JF - Experimental Mathematics
IS - 1
ER -