SearcharxivSearch

arXiv · 2607.00963

Obstructions to coarse universality for finitely generated groups

Abstract

We prove that, for every bounded-degree graph $\Lambda$ admitting a finitely cobounded coarse quasi-action by a group, there is a finitely generated group which does not coarsely embed into $\Lambda$. More generally, for every countable family $(\Lambda_i)$ of such graphs, there is a finitely generated group that does not coarsely embed into any $\Lambda_i$. This resolves two conjectures of Simon Thomas: neither a universal Cayley graph nor a universal quasi-isometry class of finitely generated groups exists. As another consequence, we show that no locally compact second countable group coarsely contains every finitely generated group. The proof uses an exponential upper bound on the number of finite graphs admitting an $(L,M)$-regular map into $\Lambda$, together with a superexponential supply of high-girth $3$-regular graphs, yielding a sequence of finite high-girth obstruction graphs. A graphical small-cancellation labeling, using a variation of Osajda's labeling theorem following Esperet and Giocanti, then realizes this sequence isometrically inside the Cayley graph of a finitely generated group.

Explore related subjects

Keep this discovery

BibTeXRIS

Robin Tucker-Drob. 2026-07-01. Obstructions to coarse universality for finitely generated groups. https://arxiv.org/abs/2607.00963

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