A bilinear Bogolyubov theorem
Abstract
The purpose of this note is to prove the existence of a remarkable structure in an iterated sumset derived from a set in a Cartesian square . More precisely, we perform horizontal and vertical sums and differences on , that is, operations on the second coordinate when the first one is fixed, or vice versa. The structure we find is the zero set of a family of bilinear forms on a Cartesian product of vector subspaces. The codimensions of the subspaces and the number of bilinear forms involved are bounded by a function of the density only. The proof uses various tools of additive combinatorics, such as the (linear) Bogolyubov theorem, the density increment method, as well as the Balog-Szemer\'edi-Gowers and Freiman-Ruzsa theorems.
Cite
@article{arxiv.1711.05349,
title = {A bilinear Bogolyubov theorem},
author = {Pierre-Yves Bienvenu and Thái Hoàng Lê},
journal= {arXiv preprint arXiv:1711.05349},
year = {2018}
}
Comments
12 pages. Second version mentions a similar posterior work of Gowers and Milicevic. Third version corrects a minor flaw in the argument