Algorithmic constructions of relative train track maps and CTs (Q1785958)

Summary: Building on [\textit{M. Bestvina} et al., Ann. Math. (2) 135, No. 1, 1--51 (1992; Zbl 0757.57004); Ann. Math. (2) 151, No. 2, 517--623 (2000; Zbl 0984.20025)], we proved in [the authors, Groups Geom. Dyn. 5, No. 1, 39--106 (2011; Zbl 1239.20036)] that every element \(\psi\) of the outer automorphism group of a finite rank free group is represented by a particularly useful relative train track map. In the case that \(\psi\) is rotationless (every outer automorphism has a rotationless power), we showed that there is a type of relative train track map, called a CT, satisfying additional properties. The main result of this paper is that the constructions of these relative train tracks can be made algorithmic. A key step in our argument is proving that it is algorithmic to check if an inclusion \(\mathcal{F}\sqsubset\mathcal{F}'\) of \(\phi\)-invariant free factor systems is reduced. We also give applications of the main result.