The primes contain arbitrarily long arithmetic progressions

by Ben Green , Terence Tao
Venue:Ann. of Math
Citations:150 - 26 self

Active Bibliography

5 Obstructions to uniformity, and arithmetic patterns in the primes, preprint – Terence Tao
3 Arithmetic progressions and the primes - El Escorial lectures – Terence Tao
2 Long arithmetic progressions of primes – Ben Green
19 The dichotomy between structure and randomness, arithmetic progressions, and the primes – Terence Tao
12 The ergodic and combinatorial approaches to Szemerédi’s theorem – Terence Tao - 2006
4 What is good mathematics – Terence Tao - 2007
18 The Green-Tao Theorem on arithmetic progressions in the primes: an ergodic point of view – Bryna Kra - 2005
34 A quantitative ergodic theory proof of Szemerédi’s theorem – Terence Tao - 2004
FROM HARMONIC ANALYSIS TO ARITHMETIC COMBINATORICS – unknown authors
Additive Combinatorics with a view towards Computer Science and Cryptography An – Khodakhast Bibak - 2011
An inverse theorem for the Gowers U³(G) norm – Ben Green, Terence Tao - 2006
30 The primes contain arbitrarily long polynomial progressions – Terence Tao, Tamar Ziegler
17 A new proof of the density Hales-Jewett theorem – D. H. J. Polymath - 2009
209 Szemerédi's Regularity Lemma and Its Applications in Graph Theory – János Komlós, Miklós Simonovits - 1996
4 Arithmetic structures in random sets – Mariah Hamel - 2008
29 Linear equations in primes – Ben Green, Terence Tao
Journal de Théorie des Nombres – unknown authors - 2005
6 Ergodic Ramsey Theory -- an Update – Vitaly Bergelson - 1996
3 Finding Large Sets Without Arithmetic Progressions of Length Three: An Empirical View and Survey II – William Gasarch, James Glenn , Clyde P. Kruskal - 2010