SearcharxivSearch

arXiv · 2008.12954

Quantifying metric approximations of discrete groups

Abstract

We introduce and systematically study a profile function whose asymptotic behavior quantifies the dimension or the size of a metric approximation of a finitely generated group $G$ by a family of groups $\mathcal{F}=\{(G_{\alpha}, d_{\alpha}, k_{\alpha}, \varepsilon_{\alpha })\}_{\alpha\in I, }$ where each group $G_\alpha$ is equipped with a bi-invariant metric $d_{\alpha}$ and a dimension $k_{\alpha}$, for strictly positive real numbers $\varepsilon_{\alpha }$ such that $\inf_{\alpha }\varepsilon_{\alpha }>0$. Through the notion of a residually amenable profile that we introduce, our approach generalizes classical isoperimetric (aka Folner) profiles of amenable groups and recently introduced functions quantifying residually finite groups. Our viewpoint is much more general and covers hyperlinear and sofic approximations as well as many other metric approximations such as weakly sofic, weakly hyperlinear, and linear sofic approximations.

Explore related subjects

Keep this discovery

BibTeXRIS

Goulnara Arzhantseva, Pierre-Alain Cherix. 2020-08-29. Quantifying metric approximations of discrete groups. https://arxiv.org/abs/2008.12954

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