Search arXivSearch

arXiv · 1502.02293

Topological matchings and amenability

Abstract

We establish a characterization of amenability for general Hausdorff topological groups in terms of matchings with respect to finite uniform coverings. Furthermore, we prove that it suffices to just consider two-element uniform coverings. We also show that extremely amenable as well as compactly approximable topological groups satisfy a perfect matching property condition -- the latter even with regard to arbitrary uniform coverings. Finally, we prove that the automorphism group of a Fra\"iss\'e limit of a metric Fra\"iss\'e class is amenable if and only if the considered metric Fra\"iss\'e class has a certain Ramsey-type matching property.

Explore related subjects

Keep this discovery

BibTeXRIS

Friedrich Martin Schneider, Andreas Thom. 2015-02-08. Topological matchings and amenability. https://doi.org/10.4064/fm248-10-2016

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