Product mixing in the alternating group
Group Theory
2017-02-14 v4 Combinatorics
Abstract
We prove the following one-sided product-mixing theorem for the alternating group: Given subsets of densities satisfying , there are at least solutions to with . One consequence is that the largest product-free subset of has density at most , which is best possible up to logarithms and improves the best previous bound of 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.
Cite
@article{arxiv.1512.03517,
title = {Product mixing in the alternating group},
author = {Sean Eberhard},
journal= {arXiv preprint arXiv:1512.03517},
year = {2017}
}
Comments
19 pages. Reformatted for Discrete Analysis but otherwise identical to the previous version