SearcharxivSearch

arXiv · 2306.17664

Bounded projections to the $\mathcal{Z}$-factor graph

Abstract

Suppose $G$ is a free product $G = A_1 * A_2* \cdots * A_k * F_N$, where each of the groups $A_i$ is torsion-free and $F_N$ is a free group of rank $N$. Let $\mathcal{O}$ be the deformation space associated to this free product decomposition. We show that the diameter of the projection of the subset of $\mathcal{O}$ where a given element has bounded length to the $\mathcal{Z}$-factor graph is bounded, where the diameter bound depends only on the length bound. This relies on an analysis of the boundary of $G$ as a hyperbolic group relative to the collection of subgroups $A_i$ together with a given non-peripheral cyclic subgroup. The main theorem is new even in the case that $G = F_N$, in which case $\mathcal{O}$ is the Culler-Vogtmann outer space. In a future paper, we will apply this theorem to study the geometry of free group extensions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matt Clay, Caglar Uyanik. 2023-06-30. Bounded projections to the $\mathcal{Z}$-factor graph. https://arxiv.org/abs/2306.17664

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