# 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}
}
• Published 12 March 2014
• Mathematics
• arXiv: Number Theory
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.
A short proof of the multidimensional Szemerédi theorem in the primes
• Mathematics
• 2015
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
• Mathematics
Proceedings of the Edinburgh Mathematical Society
• 2018
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
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
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