SearcharxivSearch

arXiv · 1608.08185

On F{\o}lner sets in topological groups

Abstract

We extend F{\o}lner's amenability criterion to the realm of general topological groups. Building on this, we show that a topological group $G$ is amenable if and only if its left translation action can be approximated in a uniform manner by amenable actions on the set $G$. As applications we obtain a topological version of Whyte's geometric solution to the von Neumann problem and provide an affirmative answer to a question posed by Rosendal.

Explore related subjects

Keep this discovery

BibTeXRIS

Friedrich Martin Schneider, Andreas Thom. 2016-08-29. On F{\o}lner sets in topological groups. https://doi.org/10.1112/s0010437x1800708x

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