SearcharxivSearch

arXiv · 1510.07156

Existence and non-existence of bounded packing in CAT(0) spaces and Gromov hyperbolic spaces

Abstract

The main result of this paper is that given a group $G$ acting geometrically by isometries on a CAT(0) space $X$ and a cyclic subgroup $H$ of $G$ generated by a rank-1 isometry of $X$, $H$ has bounded packing in $G$. We give two proofs of this result. The first one is by a characterization of rank-$1$ isometries by Hamenstadt. The second proof follows directly from some results of Dahmani-Guirardel-Osin and Sisto. Then using Mihailova's construction, we show the existence of a finitely generated subgroup of the direct product of two free groups $\mathbb F_2\times \mathbb F_2$ without the bounded packing property answering a question of Hruska-Wise. We also prove the existence of finitely presented subgroups of CAT(0) groups without bounded packing using Wise's {\em modified Rip's construction} and the {\bf 1-2-3} theorem of Baumslag, Bridson, Miller and Short.

Explore related subjects

Keep this discovery

BibTeXRIS

Pranab Sardar. 2015-10-24. Existence and non-existence of bounded packing in CAT(0) spaces and Gromov hyperbolic spaces. https://arxiv.org/abs/1510.07156

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