SearcharxivSearch

arXiv · 2104.07111

Quantifying local embeddings into finite groups

Abstract

We study a function $\mathcal{L}_{\Gamma}$ which quantifies the LEF (local embeddability into finite groups) property for a finitely generated group $\Gamma$. We compute this "LEF growth" function in some examples, including certain wreath products. We compare LEF growth with the analogous quantitative version of residual finiteness, and exhibit a family of finitely generated residually finite groups which nevertheless admit many more local embeddings into finite groups than they do finite quotients. Along the way, we give a new proof that B.H. Neumann's continuous family of $2$-generated groups contains no finitely presented group, a result originally due to Baumslag and Miller. We compare $\mathcal{L}_{\Gamma}$ with quantitative versions of soficity and other metric approximation properties of groups. Finally, we show that there exists a "universal" function which is an upper bound on the LEF growth of any group on a given number of generators, and that (for non-cyclic groups) any such function is non-computable.

Explore related subjects

Keep this discovery

BibTeXRIS

Henry Bradford. 2021-04-14. Quantifying local embeddings into finite groups. https://arxiv.org/abs/2104.07111

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