SearcharxivSearch

arXiv · 2409.19446

Latent symmetry of graphs and stretch factors in Out(Fr)

Abstract

Every irreducible outer automorphism of the free group of rank r is topologically represented by an irreducible train track map $f$ on some graph $\Gamma$ 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 $\Gamma$. In the case that $f$ is periodic on the vertex set of $\Gamma$, we show a precise notion of the latent symmetry of $\Gamma$ 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.

Explore related subjects

Keep this discovery

BibTeXRIS

Paige Hillen. 2024-09-28. Latent symmetry of graphs and stretch factors in Out(Fr). https://arxiv.org/abs/2409.19446

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR