English

A bilinear Bogolyubov theorem

Combinatorics 2018-08-09 v3

Abstract

The purpose of this note is to prove the existence of a remarkable structure in an iterated sumset derived from a set PP in a Cartesian square Fpn×Fpn\mathbb{F}_p^n\times\mathbb{F}_p^n. More precisely, we perform horizontal and vertical sums and differences on PP, 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 c(δ)c(\delta) of the density δ=P/p2n\delta=\lvert P\rvert/p^{2n} 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.

Keywords

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

R2 v1 2026-06-22T22:46:11.916Z