SearcharxivSearch

arXiv · 2307.15030

Sharp hypercontractivity for symmetric groups and its applications

Abstract

A recently fertile strand of research in Group Theory is developing non-abelian analogues of classical combinatorial results for arithmetic Cayley graphs, describing properties such as growth, expansion, mixing, diameter, etc. We consider these problems for the symmetric and alternating groups. The case of normal Cayley graphs (those generated by unions of conjugacy classes) has seen significant progress via character theory (whereby Larsen and Shalev resolved several open problems), but the general case still remains poorly understood. In this paper we generalise the background assumption from being normal to being global (a pseudorandomness condition), replacing character bounds by spectral estimates for convolution operators of global functions, thus obtaining qualitative generalisations of several results on normal Cayley graphs. Furthermore, our theory in the pseudorandom setting can be applied (via density increment arguments) to several results for general sets that are not too sparse, including analogues of Polynomial Freiman-Ruzsa, Bogolyubov's lemma, Roth's theorem, the Waring problem and essentially sharp estimates for the diameter problem of Cayley graphs whose density is at least exponential in -n. Our main tool is a sharp new hypercontractive inequality for global functions on the symmetric group.

Explore related subjects

Keep this discovery

BibTeXRIS

Peter Keevash, Noam Lifshitz. 2023-07-27. Sharp hypercontractivity for symmetric groups and its applications. https://arxiv.org/abs/2307.15030

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