SearcharxivSearch

arXiv · 1512.03517

Product mixing in the alternating group

Abstract

We prove the following one-sided product-mixing theorem for the alternating group: Given subsets $X,Y,Z \subset A_n$ of densities $α,β,γ$ satisfying $\min(αβ,αγ,βγ)\gg n^{-1}(\log n)^7$, there are at least $ (1+o(1))αβγ|A_n|^2$ solutions to $xy=z$ with $x\in X, y\in Y, z\in Z$. One consequence is that the largest product-free subset of $A_n$ has density at most $n^{-1/2}(\log n)^{7/2}$, which is best possible up to logarithms and improves the best previous bound of $n^{-1/3}$ due to Gowers. The main tools are a Fourier-analytic reduction noted by Ellis and Green to a problem just about the standard representation, a Brascamp--Lieb-type inequality for the symmetric group due to Carlen, Lieb, and Loss, and a concentration of measure result for rearrangements of inner products.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sean Eberhard. 2017-02-11. Product mixing in the alternating group. https://doi.org/10.19086/da.610

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