Finite field models in additive combinatorics
Ben Green
TL;DR
This survey highlights how finite field models, particularly $\mathbb{F}_p^n$, illuminate central problems in additive combinatorics, such as 3-term and 4-term progressions, corners, and sumsets. It synthesizes core methods—the Roth iteration, Gowers norms and inverse theorems, and Szemerédi-type regularity in groups—and explains how Bourgain’s program aims to translate finite-field insights into results for general abelian groups and integers. The work outlines key bounds in finite-field settings (e.g., $r_3(\mathbb{F}_3^n) \ll N/\log N$ and $r_4(\mathbb{F}_5^n) \ll N(\log N)^{-c}$), and discusses deep conjectures like PFR that connect doubling structure to polynomial bounds, with broad implications for understanding arithmetic structure in groups and the integers.
Abstract
The study of many problems in additive combinatorics, such as Szemerédi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of finite field models of this type, which allows us to introduce some of the central ideas in additive combinatorics relatively cleanly. We also give an indication of how the intuition gained from the study of finite field models can be helpful for addressing the original questions.