SearcharxivSearch

arXiv · 2106.08742

Amenability and profinite completions of finitely generated groups

Abstract

This article explores the interplay between the finite quotients of finitely generated residually finite groups and the concept of amenability. We construct a finitely generated, residually finite, amenable group $A$ and an uncountable family of finitely generated, residually finite non-amenable groups all of which are profinitely isomorphic to $A$. All of these groups are branch groups. Moreover, picking up Grothendieck's problem, the group $A$ embeds in these groups such that the inclusion induces an isomorphism of profinite completions. In addition, we review the concept of uniform amenability, a strengthening of amenability introduced in the 70's, and we prove that uniform amenability indeed is detectable from the profinite completion.

Explore related subjects

Keep this discovery

BibTeXRIS

Steffen Kionke, Eduard Schesler. 2021-06-16. Amenability and profinite completions of finitely generated groups. https://arxiv.org/abs/2106.08742

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