SearcharxivSearch

arXiv · 2201.06442

Coarse embeddings of symmetric spaces and Euclidean buildings

Abstract

Introduced by Gromov in the 80's, coarse embeddings are a generalization of quasi-isometric embeddings when the control functions are not necessarily affine. In this paper, we will be particularly interested in coarse embeddings between symmetric spaces and Euclidean buildings. The quasi-isometric case is very well understood thanks to the rigidity results for symmetric spaces and buildings of higher rank by Anderson-Schroeder, Kleiner, Kleiner-Leeb, Eskin-Farb and Fisher-Whyte. In particular, it is well known that the rank of these spaces is monotonous under quasi-isometric embeddings. This is no longer the case for coarse embeddings as shown by horospherical embeddings. However, we show that in the absence of a Euclidean factor in the domain, the rank is monotonous under coarse embeddings. This answers a question by David Fisher and Kevin Whyte. This still holds when we replace the target space by a proper cocompact CAT(0) space or by a mapping class group. Between symmetric spaces and Euclidean buildings, we can also relax the condition on the domain by allowing it to contain a Euclidean factor of dimension 1, answering a question by Gromov.

Explore related subjects

Keep this discovery

BibTeXRIS

Oussama Bensaid. 2022-01-17. Coarse embeddings of symmetric spaces and Euclidean buildings. https://arxiv.org/abs/2201.06442

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