SearcharxivSearch

arXiv · 1408.0544

Hyperbolic graphs for free products, and the Gromov boundary of the graph of cyclic splittings

Abstract

We define analogues of the graphs of free splittings, of cyclic splittings, and of maximally-cyclic splittings of $F_N$ for free products of groups, and show their hyperbolicity. Given a countable group $G$ which splits as $G=G_1\ast\dots\ast G_k\ast F$, where $F$ denotes a finitely generated free group, we identify the Gromov boundary of the graph of relative cyclic splittings with the space of equivalence classes of $\mathcal{Z}$-averse trees in the boundary of the corresponding outer space. A tree is \emph{$\mathcal{Z}$-averse} if it is not compatible with any tree $T'$, that is itself compatible with a relative cyclic splitting. Two $\mathcal{Z}$-averse trees are \emph{equivalent} if they are both compatible with a common tree in the boundary of the corresponding outer space. We give a similar description of the Gromov boundary of the graph of maximally-cyclic splittings.

Explore related subjects

Keep this discovery

BibTeXRIS

Camille Horbez. 2014-08-03. Hyperbolic graphs for free products, and the Gromov boundary of the graph of cyclic splittings. https://doi.org/10.1112/jtopol%2Fjtv045

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