BibTeX
@MISC{Green_finitefield,
author = {Ben Green},
title = {Finite field models in arithmetic combinatorics},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 Fn p, 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. 1.
