Finite field models in additive combinatorics
Author:
Preprint
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
All Related Versions
This publication has 10 references indexed in Scilit:
- On a problem of GowersIzvestiya: Mathematics, 2006
- Progression-free sets in finite abelian groupsJournal of Number Theory, 2004
- Restriction and Kakeya phenomena for finite fieldsDuke Mathematical Journal, 2004
- On a Question of GowersAnnals of Combinatorics, 2002
- Arithmetic progressions in sumsetsGeometric and Functional Analysis, 2002
- On subsets of finite abelian groups with no 3-term arithmetic progressionsJournal of Combinatorial Theory, Series A, 1995
- The Algorithmic Aspects of the Regularity LemmaJournal of Algorithms, 1994
- Quasi-random graphsCombinatorica, 1989
- Integer Sets Containing No Arithmetic ProgressionsJournal of the London Mathematical Society, 1987
- On Sets of Integers Which Contain No Three Terms in Arithmetical ProgressionProceedings of the National Academy of Sciences, 1946