Low complexity among principal fully irreducible elements of \(\mathrm{Out}(F3)\) (Q7295166)

The minimum stretch factor among fully irreducible elements of \(\mathrm{Out}(F_3)\) is shown to be the largest real root of \(x^5-x-1\), approximately \(1.167\). It is realized by the outer automorphism \(\psi\) of \(F_3\) defined by \(x\mapsto y\), \(y\mapsto z\) and \(z\mapsto zx^{-1}\). The authors construct an irreducible train track representative of \(\psi\) and prove that \(\psi\) is principal and fully irreducible. Here a fully irreducible element of \(\mathrm{Out}(F_r)\) is principal when its ideal Whitehead graph is the disjoint union of \(2r-3\) triangles. The minimality proof uses the fact that every stretch factor of a fully irreducible outer automorphism is a Perron number. It reduces the possible algebraic degree to at most five and excludes the smaller degree-five candidate because its characteristic polynomial would force a transition matrix with negative trace.\N\NThe paper also introduces the rank-three principal stratum automaton \(\widehat{\mathcal A}_3\), obtained by adjoining permutation relabelings to the lonely direction automaton. It is proved that the Stallings fold decomposition of every train track representative of a principal fully irreducible element of \(\mathrm{Out}(F_3)\) is partial-fold conjugate to one determining a directed loop in \(\widehat{\mathcal A}_3\). Finally, up to edge relabeling, the exhibited train track map representing \(\psi\) is the unique principal fully irreducible train track map in any rank whose Stallings fold decomposition consists of a single fold followed by a graph-relabeling isomorphism; in particular, no such map exists in rank \(r\geq4\).