SearcharxivSearch

arXiv · 2010.07400

Strongly Shortcut Spaces

Abstract

We define the strong shortcut property for rough geodesic metric spaces, generalizing the notion of strongly shortcut graphs. We show that the strong shortcut property is a rough similarity invariant. We give several new characterizations of the strong shortcut property, including an asymptotic cone characterization. We use this characterization to prove that asymptotically CAT(0) spaces are strongly shortcut. We prove that if a group acts metrically properly and coboundedly on a strongly shortcut rough geodesic metric space then it has a strongly shortcut Cayley graph and so is a strongly shortcut group. Thus we show that CAT(0) groups are strongly shortcut. To prove these results, we use several intermediate results which we believe may be of independent interest, including what we call the Circle Tightening Lemma and the Fine Milnor-Schwarz Lemma. The Circle Tightening Lemma describes how one may obtain a quasi-isometric embedding of a circle by performing surgery on a rough Lipschitz map from a circle that sends antipodal pairs of points far enough apart. The Fine Milnor-Schwarz Lemma is a refinement of the Milnor-Schwarz Lemma that gives finer control on the multiplicative constant of the quasi-isometry from a group to a space it acts on.

Explore related subjects

Keep this discovery

BibTeXRIS

Nima Hoda. 2020-10-14. Strongly Shortcut Spaces. https://doi.org/10.2140/agt.2024.24.3291

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