Finite field models in additive combinatorics
Number Theory
2007-05-23 v1 Combinatorics
Abstract
The study of many problems in additive combinatorics, such as Szemer\'edi'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.
Keywords
Cite
@article{arxiv.math/0409420,
title = {Finite field models in additive combinatorics},
author = {Ben Green},
journal= {arXiv preprint arXiv:math/0409420},
year = {2007}
}
Comments
24 page survey article, submitted to Surveys in Combinatorics 2005. There are two supplementary documents, containing some proofs related to this article, on the author's webpage