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 ⊂ An of densities α,β,γ satisfying (αβ,αγ,βγ) n-1( n)7, there are at least (1+o(1))αβγ |An|2 solutions to xy=z with x∈ X, y∈ Y, z∈ Z. One consequence is that the largest product-free subset of An has density at most n-1/2( 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.