Finite field models in additive combinatories

@inproceedings{Green2005FiniteFM,
  title={Finite field models in additive combinatories},
  author={Ben Green},
  booktitle={BCC},
  year={2005}
}
  • B. Green
  • Published in BCC 22 September 2004
  • Mathematics
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… 
J. (2015). Finite field models in arithmetic combinatorics – ten years on. Finite Fields and Their Applications , 32 , 233-274.
  • Mathematics
  • 2014
. It has been close to ten years since the publication of Green’s influential survey Finite field models in additive combinatorics [ ? ], in which the author championed the use of high-dimensional
Ramsey multiplicity of linear patterns in certain finite abelian groups
In this article we explore an arithmetic analogue of a long-standing open problem in graph theory: what can be said about the number of monochromatic additive configurations in 2-colourings of finite
Equivalence of polynomial conjectures in additive combinatorics
TLDR
The main result is that the two conjectures in additive combinatorics, the polynomial Freiman-Ruzsa conjecture and the inverse Gowers conjecture for U3, are in fact equivalent.
Selected Results in Additive Combinatorics: An Exposition
TLDR
In particular, the celebrated theorems known as the Balog-Szemeredi-Gowers theorem and the Freiman-Ruzsa theorem are proved, leading to the remarkable result by Samorodnitsky (’07) that linear transformations are efficiently testable.
Additive Combinatorics and its Applications in Theoretical Computer Science
TLDR
The goal of this survey is to provide an introduction to additive combinatorics for students and researchers in theoretical computer science, to illustrate some of the exciting connections to classical problems in theoreticalComputer science, and to describe the many open problems that remain.
Selected Results in Additive Combinatorics : An Exposition ( Preliminary Version )
We give a self-contained exposition of selected results in additive combinatorics over the group GF (2)n = {0, 1}n. In particular, we prove the celebrated theorems known as the Balog-Szemeredi-Gowers
Carries, Group Theory, and Additive Combinatorics
TLDR
Given a group and a normal subgroup, the problem of choosing coset representatives with few “carries” is studied and a gentle introduction to some results and techniques of additive combinatorics is given.
New bounds for Szemeredi's theorem, Ia: Progressions of length 4 in finite field geometries revisited
Let p > 4 be a prime. We show that the largest subset of F_p^n with no 4-term arithmetic progressions has cardinality << N(log N)^{-c}, where c = 2^{-22} and N := p^n. A result of this type was
Szemerédi ’ s Theorem and The Green-Tao Theorem 2 . 1
TLDR
In the past ten years, additive and arithmetic combinatorics have been extremely successful areas of mathematics, featuring a convergence of techniques from graph theory, analysis and ergodic theory.
...
...

References

SHOWING 1-10 OF 28 REFERENCES
Additive Number Theory: Inverse Problems and the Geometry of Sumsets
Many classical problems in additive number theory are direct problems, in which one starts with a set A of natural numbers and an integer H -> 2, and tries to describe the structure of the sumset hA
On Subsets of Finite Abelian Groups with No 3-Term Arithmetic Progressions
Freiman's theorem in an arbitrary abelian group
A famous result of Freiman describes the structure of finite sets A ⊆ ℤ with small doubling property. If |A + A| ⩽ K|A|, then A is contained within a multidimensional arithmetic progression of
The Probabilistic Method
TLDR
A particular set of problems - all dealing with “good” colorings of an underlying set of points relative to a given family of sets - is explored.
Szemeredi''s Regularity Lemma and its applications in graph theory
Szemer\''edi''s Regularity Lemma is an important tool in discrete mathematics. It says that, in some sense, all graphs can be approximated by random-looking graphs. Therefore the lemma helps in
Integer Sets Containing No Arithmetic Progressions
lfh and k are positive integers there exists N(h, k) such that whenever N ^ N(h, k), and the integers 1,2,...,N are divided into h subsets, at least one must contain an arithmetic progression of
Regular Partitions of Graphs
Abstract : A crucial lemma in recent work of the author (showing that k-term arithmetic progression-free sets of integers must have density zero) stated (approximately) that any large bipartite graph
The primes contain arbitrarily long arithmetic progressions
We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi�s theorem, which asserts that any subset of the integers of
Progression-free sets in finite abelian groups
...
...