English

A bilinear version of Bogolyubov's theorem

Combinatorics 2017-12-04 v1

Abstract

A theorem of Bogolyubov states that for every dense set AA in ZN\mathbb{Z}_N we may find a large Bohr set inside A+AAAA+A-A-A. In this note, motivated by the work on a quantitative inverse theorem for the Gowers U4U^4 norm, we prove a bilinear variant of this result in vector spaces over finite fields. Namely, if we start with a dense set AFpn×FpnA \subset \mathbb{F}^n_p \times \mathbb{F}^n_p and then take rows (respectively columns) of AA and change each row (respectively column) to the set difference of it with itself, repeating this procedure several times, we obtain a bilinear analogue of a Bohr set inside the resulting set, namely the zero set of a biaffine map from Fpn×Fpn\mathbb{F}^n_p \times \mathbb{F}^n_p to a Fp\mathbb{F}_p-vector space of bounded dimension. An almost identical result was proved independently by Bienvenu and L\^e.

Keywords

Cite

@article{arxiv.1712.00248,
  title  = {A bilinear version of Bogolyubov's theorem},
  author = {W. T. Gowers and L. Milićević},
  journal= {arXiv preprint arXiv:1712.00248},
  year   = {2017}
}

Comments

9 pages