The primes contain arbitrarily long arithmetic progressions
From MaRDI portal
Publication:2389092
DOI10.4007/ANNALS.2008.167.481zbMATH Open1191.11025arXivmath/0404188OpenAlexW2097673562WikidataQ55898603 ScholiaQ55898603MaRDI QIDQ2389092FDOQ2389092
Authors: Terence Tao, Ben Green 
Publication date: 14 July 2009
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Abstract: 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 positive density contains progressions of arbitrary length. The second, which is the main new ingredient of this paper, is a certain transference principle. This allows us to deduce from Szemeredi's theorem that any subset of a sufficiently pseudorandom set of positive relative density contains progressions of arbitrary length. The third ingredient is a recent result of Goldston and Yildirim. Using this, one may place the primes inside a pseudorandom set of ``almost primes with positive relative density.
Full work available at URL: https://arxiv.org/abs/math/0404188
Recommendations
- scientific article; zbMATH DE number 5233961
- The Green-Tao Theorem on arithmetic progressions in the primes: an ergodic point of view
- Arithmetic progressions in prime numbers (after B. Green and T. Tao)
- Almost arithmetic progressions in the primes and other large sets
- Obstructions to uniformity and arithmetic patterns in the primes
- A multidimensional Szemerédi theorem in the primes via combinatorics
- The primes contain arbitrarily long polynomial progressions
- The Green-Tao theorem: an exposition
- Arithmetic progressions and the primes
- Roth's theorem in the primes
Cited In (only showing first 100 items - show all)
- A remark on the geometry of spaces of functions with prime frequencies
- Lower bounds for the least common multiple of finite arithmetic progressions
- Reciprocal sums and counting functions
- An application of proof mining to nonlinear iterations
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- A density version of Vinogradov's three primes theorem
- On classification of sequences containing arbitrarily long arithmetic progressions
- Narrow arithmetic progressions in the primes
- Strong Convergence for the Alternating Halpern–Mann Iteration in CAT(0) Spaces
- A Hardy field extension of Szemerédi's theorem
- The least common multiple of consecutive terms in a quadratic progression
- Graph norms and Sidorenko's conjecture
- Combinatorial theorems in sparse random sets
- An inverse theorem for the uniformity seminorms associated with the action of \(\mathbb F_p^\infty\)
- Long arithmetic progressions in \(A+A+A\) with \(A\) a prime subset
- Energies and structure of additive sets
- An approximate logic for measures
- Universal characteristic factors and Furstenberg averages
- The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
- Finite configurations in sparse sets
- Sum-avoiding sets in groups
- Uniformity seminorms on \(\ell^{\infty}\) and applications
- On the distribution of \(\alpha p\) modulo one for primes \(p\) of a special form
- The primes contain arbitrarily long polynomial progressions
- Roth's theorem in the primes
- Prime power and prime product distance graphs
- Primes in intervals of bounded length
- Note on the lower bound of least common multiple
- Ubiquity of simplices in subsets of vector spaces over finite fields
- Large gaps between consecutive prime numbers
- Partition regularity and the primes
- The inverse conjecture for the Gowers norm over finite fields in low characteristic
- Multiple recurrence and convergence for sequences related to the prime numbers
- A counterexample to the Bollobás–Riordan conjectures on sparse graph limits
- Quadratic uniformity of the Möbius function
- Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\)
- A Schur-type addition theorem for primes
- Arithmetic progressions in sets of fractional dimension
- The ternary Goldbach problem with primes in positive density sets
- Problems and Results on Intersective Sets
- Decompositions, approximate structure, transference, and the Hahn-Banach theorem
- On the stability of the Erdős-Ko-Rado theorem
- Parallelepipeds, nilpotent groups and Gowers norms
- An inverse theorem for the Gowers \(U^{s+1}[N]\)-norm
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
- AN -FUNCTION-FREE PROOF OF VINOGRADOV’S THREE PRIMES THEOREM
- An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
- Linear equations in primes
- A Marstrand theorem for subsets of integers
- Growth in groups: ideas and perspectives
- Improvements of lower bounds for the least common multiple of finite arithmetic progressions
- The Green-Tao Theorem on arithmetic progressions in the primes: an ergodic point of view
- A relative Szemerédi theorem
- Enveloping semigroups in topological dynamics
- The least common multiple of consecutive arithmetic progression terms
- A variant of the hypergraph removal lemma
- Minimal permutation representations of semidirect products of groups.
- A Linked Pair of Sequences Implies the Primes Are Infinite
- Some open problems on multiple ergodic averages
- Reconstruction of signals: uniqueness and stable sampling
- Polignac numbers, conjectures of Erdős on gaps between primes, arithmetic progressions in primes, and the bounded gap conjecture
- Extremal results in sparse pseudorandom graphs
- From harmonic analysis to arithmetic combinatorics
- Large values of the Gowers-Host-Kra seminorms
- Restriction theory of the Selberg sieve, with applications
- Expander graphs in pure and applied mathematics
- A hypergraph regularity method for generalized Turán problems
- On the KŁR conjecture in random graphs
- A Birch-Goldbach theorem
- A compendium of results in additive number theory
- Monochromatic integers adding to polynomials of prime variables
- What is good mathematics?
- \(\mathcal {F}\)-finite embeddabilities of sets and ultrafilters
- A density version of the Vinogradov three primes theorem
- Counting pseudo progressions
- On the least odd quadratic non-residue
- Strings of special primes in arithmetic progressions
- Intersective polynomials and the primes
- Are There Arbitrarily Long Arithmetic Progressions In The Sequence of Twin Primes?
- Ergodic aspects of number theory. Paper from the 26th Brazilian Mathematics Colloquium -- Colóquio Brasileiro de Matemática, Rio de Janeiro, Brazil, July 29--August 3, 2007
- Multiple recurrence and convergence for Hardy sequences of polynomial growth
- On the periodicity of an arithmetical function
- Finite prime distance graphs and 2-odd graphs
- Conjugacy class sizes in arithmetic progression
- Finite and infinite arithmetic progressions related to beta-expansion
- Generalized Fourier coefficients of multiplicative functions
- The Green-Tao theorem on primes in arithmetical progressions in the positive cone of \(\mathbb Z [X]\)
- Arithmetic progressions in the graphs of slightly curved sequences
- Prime solutions to polynomial equations in many variables and differing degrees
- An abelian loop for non-composite numbers
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Distributions of finite sequences represented by polynomials in Piatetski-Shapiro sequences
- Longest arithmetic progressions of palindromes
- On the notions of upper and lower density
- On Assouad dimension and arithmetic progressions in sets defined by digit restrictions
- Equisum partitions of sets of positive integers
- On arithmetic progressions in model sets
- Diophantine equations in primes: density of prime points on affine hypersurfaces
- Finite field models in arithmetic combinatorics -- ten years on
- The ABC conjecture, arithmetic progressions of primes and squarefree values of polynomials at prime arguments
This page was built for publication: The primes contain arbitrarily long arithmetic progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2389092)
