English

A note on the Bilinear Bogolyubov Theorem: Transverse and bilinear sets

Combinatorics 2018-11-27 v1

Abstract

A set PFpn×FpnP\subset \mathbb{F}_p^n\times\mathbb{F}_p^n is called bilinear\textit{bilinear} when it is the zero set of a family of linear and bilinear forms, and transverse\textit{transverse} when it is stable under vertical and horizontal sums. A theorem of the first author provides a generalization of Bogolyubov's theorem to the bilinear setting. Roughly speaking, it implies that any dense transverse set PFpn×FpnP\subset \mathbb{F}_p^n\times\mathbb{F}_p^n contains a large bilinear set. In this paper, we elucidate the extent to which a transverse set is forced to be (and not only contain) a bilinear set.

Keywords

Cite

@article{arxiv.1811.09853,
  title  = {A note on the Bilinear Bogolyubov Theorem: Transverse and bilinear sets},
  author = {Pierre-Yves Bienvenu and Diego González-Sánchez and Ángel D. Martínez},
  journal= {arXiv preprint arXiv:1811.09853},
  year   = {2018}
}

Comments

10 pages, 2 figures