A bilinear Bogolyubov theorem

2017/11/14 by Bienvenu, Pierre-Yves, Lê, Thái Hoàng · 1 citation
#11B30 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1711.05349

Abstract

The purpose of this note is to prove the existence of a remarkable structure in an iterated sumset derived from a set P in a Cartesian square \mathbbF_pⁿ×\mathbbF_pⁿ. More precisely, we perform horizontal and vertical sums and differences on P, 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(δ) of the density δ=| P|/p²ⁿ 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édi-Gowers and Freiman-Ruzsa theorems.

Cited by

• Möbius function is strongly orthogonal to polynomial phases over \mathbbF_p[t]

Related

• A note on the Bilinear Bogolyubov Theorem: Transverse and bilinear sets
• A Bilinear Bogolyubov Argument in Abelian Groups
• A bilinear version of Bogolyubov's theorem
• Bilinear forms with trace functions over arbitrary sets, and applications to Sato-Tate
• On Effective Witt Decomposition and the Cartan–Dieudonné Theorem