The Green-Tao theorem: an exposition

@article{Conlon2014TheGT,
  title={The Green-Tao theorem: an exposition},
  author={David Conlon and Jacob Fox and Yufei Zhao},
  journal={arXiv: Number Theory},
  year={2014},
  volume={1},
  pages={249-282}
}
The celebrated Green-Tao theorem states that the prime numbers contain arbitrarily long arithmetic progressions. We give an exposition of the proof, incorporating several simplifications that have been discovered since the original paper. 

Figures and Tables from this paper

A short proof of the multidimensional Szemerédi theorem in the primes
Tao conjectured that every dense subset of ${\mathcal P}^d$, the $d$-tuples of primes, contains constellations of any given shape. This was very recently proved by Cook, Magyar, and Titichetrakun and
Szemerédi's Theorem in the Primes
Abstract Green and Tao famously proved in 2005 that any subset of the primes of fixed positive density contains arbitrarily long arithmetic progressions. Green had previously shown that, in fact, any
Combinatorial theorems relative to a random set
We describe recent advances in the study of random analogues of combinatorial theorems.
Quantitative bounds in the inverse theorem for the Gowers $U^{s+1}$-norms over cyclic groups
We provide a new proof of the inverse theorem for the Gowers $U^{s+1}$-norm over groups $H=\mathbb Z/N\mathbb Z$ for $N$ prime. This proof gives reasonable quantitative bounds (the worst parameters
Linear, bilinear and polynomial structures in function fields and the primes
TLDR
A bidirectional additive smoothing result for sets of pairs P ⊂ Fp × Fp is proved, which is a bilinear version of Bogolyubov’s theorem.
A multidimensional Szemerédi's theorem in the primes
Let $A$ be a subset of positive relative upper density of $\PP^d$, the $d$-tuples of primes. We prove that $A$ contains an affine copy of any finite set $F\subs\Z^d$, which provides a natural
Some applications of relative entropy in additive combinatorics
Abstract This survey looks at some recent applications of relative entropy in additive combinatorics. Specifically, we examine to what extent entropy-increment arguments can replace or even
N ov 2 02 1 Arbitrarily Large Goldbach ( Even ) Integers
On investigating the subject of partitions on a prescribed subset of integers, Chen proved in 1966 that every sufficiently large even integer is the sum of a prime and a number with no more than two
The Szemerédi Regularity Lemma
TLDR
The main focus of the paper is to demonstrate the use of the lemma in several applications including the Triangle Removal Lemma, Roth's Theorem, the Erdős-Stone theorem and more.
On Systems of Complexity One in the Primes
  • K. Henriot
  • Mathematics
    Proceedings of the Edinburgh Mathematical Society
  • 2016
Abstract Consider a translation-invariant system of linear equations Vx = 0 of complexity one, where V is an integer r × t matrix. We show that if A is a subset of the primes up to N of density at
...
1
2
3
...

References

SHOWING 1-10 OF 55 REFERENCES
On Roth's theorem on progressions
We show that if Af 1;:::;Ng contains no nontrivial three-term arithmetic progressions thenjAj = O(N=log 1 o(1) N).
Arithmetic progressions and the primes
We describe some of the machinery behind recent progress in establishing infinitely many arithmetic progressions of length k in various sets of integers, in particular in arbitrary dense subsets of
The Green-Tao Theorem on arithmetic progressions in the primes: an ergodic point of view
A long standing and almost folkloric conjecture is that the primes contain arbitrarily long arithmetic progressions. Until recently, the only progress on this conjecture was due to van der Corput,
A short proof of the multidimensional Szemerédi theorem in the primes
Tao conjectured that every dense subset of ${\mathcal P}^d$, the $d$-tuples of primes, contains constellations of any given shape. This was very recently proved by Cook, Magyar, and Titichetrakun and
The ergodic theoretical proof of Szemerédi's theorem
Partial results were obtained previously by K. F. Roth (1952) who established the existence of arithmetic progressions of length three in subsets of Z of positive upper density, and by E. Szemeredi
A new proof of Szemerédi's theorem
In 1927 van der Waerden published his celebrated theorem on arithmetic progressions, which states that if the positive integers are partitioned into finitely many classes, then at least one of these
A New Proof of Szemerédi's Theorem for Arithmetic Progressions of Length Four
Abstract. ((Without abstract))
A relative Szemerédi theorem
The celebrated Green-Tao theorem states that there are arbitrarily long arithmetic progressions in the primes. One of the main ingredients in their proof is a relative Szemerédi theorem which says
A quantitative improvement for Roth's theorem on arithmetic progressions
  • T. Bloom
  • Mathematics, Computer Science
    J. Lond. Math. Soc.
  • 2016
TLDR
The quantitative estimate for Roth's theorem is improved, showing that if A⊂{1,...,N} contains no non‐trivial three‐term arithmetic progressions, then |A|≪N(loglogN)4/logN .
Quasi-random graphs
TLDR
A large equivalence class of graph properties is introduced, all of which are shared by so-called random graphs, and it is often relatively easy to verify that a particular family of graphs possesses some property in this class.
...
1
2
3
4
5
...