SearcharxivSearch

arXiv · 1901.02445

On the nonexistence of F{\o}lner sets

Abstract

We show that there is $n\in \mathbf N$, a finite system $\Sigma(\vec x,\vec y)$ of equations and inequations having a solution in some group, where $\vec x$ has length $n$, and $\epsilon>0$ such that: for any group $G$ and any $\vec a\in G^n$, if the system $\Sigma(\vec a,\vec y)$ has a solution in $G$, then there is no $(\vec a,\epsilon)$-F{\o} lner set in $G$. The proof uses ideas from model-theoretic forcing together with the observation that no amenable group can be existentially closed. Along the way, we also observe that no existentially closed group can be exact, have the Haagerup property, or have property (T). Finally, we show that, for $n$ large enough and for $\epsilon$ small enough, the existence of $(F,\epsilon)$-F{\o} lner sets, where $F$ has size at most $n$, cannot be expressed in a first-order way uniformly in all groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Isaac Goldbring. 2019-01-08. On the nonexistence of F{\o}lner sets. https://arxiv.org/abs/1901.02445

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