Compression of uniform embeddings into Hilbert space

N. Brodskiy; D. Sonkin

Home/Archive/arXiv

arXiv · math/0509108

Compression of uniform embeddings into Hilbert space

N. Brodskiy·D. Sonkin

View original source ↗Read source document ↗Export metadata ↓

Abstract

If one tries to embed a metric space uniformly in Hilbert space, how close to quasi-isometric could the embedding be? We answer this question for finite dimensional CAT(0) cube complexes and for hyperbolic groups. In particular, we show that the Hilbert space compression of any hyperbolic group is 1.

Explore related subjects

math.GR math.FA math.GT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

N. Brodskiy, D. Sonkin. 2005-09-05. Compression of uniform embeddings into Hilbert space. https://arxiv.org/abs/math/0509108

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗