English

A Bilinear Bogolyubov Argument in Abelian Groups

Combinatorics 2024-12-30 v3 Number Theory

Abstract

The bilinear Bogolyubov argument for Fpn\mathbb{F}_p^n states that if we start with a dense set AFpn×FpnA \subseteq \mathbb{F}_p^n \times \mathbb{F}_p^n and carry out sufficiently many steps where we replace every row or every column of AA by the set difference of it with itself, then inside the resulting set we obtain a bilinear variety of codimension bounded in terms of density of AA. In this paper, we generalize the bilinear Bogolyubov argument to arbitrary finite abelian groups. Namely, if GG and HH are finite abelian groups and AG×HA \subseteq G \times H is a subset of density δ\delta, then the procedure above applied to AA results in a set that contains a bilinear analogue of a Bohr set, with the appropriately defined codimension bounded above by logO(1)(O(δ1))\log^{O(1)} (O(\delta^{-1})).

Keywords

Cite

@article{arxiv.2109.03093,
  title  = {A Bilinear Bogolyubov Argument in Abelian Groups},
  author = {L. Milićević},
  journal= {arXiv preprint arXiv:2109.03093},
  year   = {2024}
}

Comments

41 pages, final version

R2 v1 2026-06-24T05:45:24.110Z