This analysis provides lower bounds for stretch factors in graphs regarding outer automorphisms, indicating important structural classifications.
Every irreducible outer automorphism of the free group of rank r is topologically represented by an irreducible train track map f: Γ → Γ for some graph Γ of rank r . Moreover, f can always be written as a composition of “folds” and a graph isomorphism. We give a lower bound on the stretch factor of an irreducible outer automorphism in terms of the number of folds of f and the number of edges in Γ . In the case that f is periodic on the vertex set of Γ , we show a precise notion of the latent symmetry of Γ gives a lower bound on the number of folds required. We use this notion of latent symmetry to classify all possible irreducible single fold train track maps.
No takes yet. Share an insight, caveat, or question.
Paige Hillen (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: