Search arXivSearch

arXiv · 1302.1186

Quasirandom group actions

Abstract

Let $G$ be a finite group acting transitively on a set $\Omega$. We study what it means for this action to be {\it quasirandom}, thereby generalizing Gowers' study of quasirandomness in groups. We connect this notion of quasirandomness to an upper bound for the convolution of functions associated with the action of $G$ on $\Omega$. This convolution bound allows us to give sufficient conditions such that sets $S,T\subset G$ and $\Gamma\subseteq \Omega$ contain elements $s\in S, t\in T, \gamma\in\Gamma$ such that $s(\gamma)=t$. Other consequences include an analogue of `the Gowers trick' of Nikolov and Pyber for general group actions, a sum-product type theorem for large subsets of a finite field, as well as applications to expanders and to the study of the diameter and width of a finite simple group.

Explore related subjects

Keep this discovery

BibTeXRIS

Nick Gill. 2013-02-05. Quasirandom group actions. https://arxiv.org/abs/1302.1186

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