The primes contain arbitrarily long polynomial progressions

DOI10.1007/S11511-008-0032-5zbMATH Open1230.11018arXivmath/0610050OpenAlexW2084705636WikidataQ56689354 ScholiaQ56689354MaRDI QIDQ732174FDOQ732174

Authors: Tamar Ziegler, Terence Tao 

Publication date: 9 October 2009

Published in: Acta Mathematica (Search for Journal in Brave)

Abstract: We establish the existence of infinitely many emph{polynomial} progressions in the primes; more precisely, given any integer-valued polynomials $$ in one unknown $m$ with $P_1(0)=\mathrm{...}=P_k(0)=0$ and any $eps>0$, we show that there are infinitely many integers $x,m$ with $1leqmleq{x}^{e}ps$ such that $x+P_1(m),\mathrm{...},x+P_k(m)$ are simultaneously prime. The arguments are based on those in Green and Tao, which treated the linear case $P_i=(i-1)m$ and $eps=1$; the main new features are a localization of the shift parameters (and the attendant Gowers norm objects) to both coarse and fine scales, the use of PET induction to linearize the polynomial averaging, and some elementary estimates for the number of points over finite fields in certain algebraic varieties.

Full work available at URL: https://arxiv.org/abs/math/0610050

Recommendations

• Arithmetic progressions in prime numbers (after B. Green and T. Tao)
• The Green-Tao Theorem on arithmetic progressions in the primes: an ergodic point of view
• The Chen primes contain arbitrarily long arithmetic progressions
• Arithmetic and polynomial progressions in the primes [after Gowers, Green, Tao and Ziegler]
• ERGODIC AVERAGES FOR INDEPENDENT POLYNOMIALS AND APPLICATIONS
• The primes contain arbitrarily long arithmetic progressions
• Arithmetic progressions and the primes
• scientific article; zbMATH DE number 5233961
• A multidimensional Szemerédi theorem in the primes via combinatorics
• Arithmetic progressions - an operator theoretic view

zbMATH Keywords

primespolynomial progressions[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=polynomial+Szemer%EF%BF%BD%EF%BF%BDdi+theorem&go=Go polynomial Szemer��di theorem]

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30) Pseudo-random numbers; Monte Carlo methods (11K45) Distribution of primes (11N05) Applications of sieve methods (11N36)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
• La conjecture de Weil. I
• Weakly mixing PET
• On difference sets of sequences of integers. I
• Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
• A new proof of Szemerédi's theorem
• La conjecture de Weil. II
• Difference sets without \(\kappa\)-th powers
• On arithmetic structures in dense sets of integers
• On Certain Sets of Positive Density
• On Sets of Natural Numbers Whose Difference Set Contains No Squares
• On sets of integers containing k elements in arithmetic progression
• Title not available (Why is that?)
• An ergodic Szemerédi theorem for commuting transformations
• The primes contain arbitrarily long arithmetic progressions
• Combinatorial Nullstellensatz
• Title not available (Why is that?)
• A variant of the hypergraph removal lemma
• Aspects of uniformity in recurrence
• Convergence of multiple ergodic averages along polynomials of several variables
• AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM
• Convergence of polynomial ergodic averages
• Polynomial averages converge to the product of integrals
• Title not available (Why is that?)
• Title not available (Why is that?)
• Additive properties of dense subsets of sifted sequences
• Obstructions to uniformity and arithmetic patterns in the primes
• A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
• Linear equations in primes
• A polynomial Sárközy-Furstenberg theorem with upper bounds
• The Gaussian primes contain arbitrarily shaped constellations
• Arithmetic progressions in prime numbers (after B. Green and T. Tao)

Cited In (59)

• Enveloping sieve related to the Hardy-Littlewood irreducible tuple conjecture in a function field
• Additive combinatorics: with a view towards computer science and cryptography -- an exposition
• Narrow arithmetic progressions in the primes
• More primes and polynomials
• A Hardy field extension of Szemerédi's theorem
• Polynomial configurations in subsets of random and pseudo-random sets
• A higher-dimensional Siegel-Walfisz theorem
• Almost arithmetic progressions in the primes and other large sets
• Asymptotics for some polynomial patterns in the primes
• A multi-dimensional Szemerédi theorem for the primes via a correspondence principle
• Almost prime solutions to diophantine systems of high rank
• A transference principle for systems of linear equations, and applications to almost twin primes
• Polynomial extensions of the Milliken-Taylor theorem
• The ABC conjecture, arithmetic progressions of primes and squarefree values of polynomials at prime arguments
• Roth's theorem in the primes
• Long Arithmetic Progressions of Primes: Some Old, Some New
• The Green-Tao Theorem and the Infinitude of Primes in Domains
• Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\)
• On systems of complexity one in the primes
• Problems and Results on Intersective Sets
• Linear equations in primes
• Multiple recurrence and convergence along the primes
• A multidimensional Szemerédi theorem in the primes via combinatorics
• Multidimensional configurations in the primes with shifted prime steps
• A relative Szemerédi theorem
• Patterns of primes in Chebotarev sets
• Arithmetic progressions in prime numbers (after B. Green and T. Tao)
• The complexity of differential privacy
• Arithmetic and polynomial progressions in the primes [after Gowers, Green, Tao and Ziegler]
• Some open problems on multiple ergodic averages
• Advice lower bounds for the dense model theorem
• From harmonic analysis to arithmetic combinatorics
• The primes contain arbitrarily long arithmetic progressions
• A view on multiple recurrence
• Small gaps between configurations of prime polynomials
• Restriction theory of the Selberg sieve, with applications
• On Galois extensions with prescribed decomposition groups
• Szemerédi's Theorem in the Primes
• An analytic approach to sparse hypergraphs: hypergraph removal
• A general nonlinear version of Roth's theorem on the real line
• Erratum to ``The primes contain arbitrarily long polynomial progressions
• Bounds for sets with no polynomial progressions
• Joint ergodicity of fractional powers of primes
• Quantitative bounds in the polynomial Szemerédi theorem: the homogeneous case
• Metric pseudoentropy: characterizations, transformations and applications
• A polynomial Roth theorem on the real line
• Small sets containing any pattern
• Further bounds in the polynomial Szemerédi theorem over finite fields
• Green-Tao theorem in function fields
• An arithmetic transference proof of a relative Szemerédi theorem
• Intersective polynomials and the primes
• The Chen primes contain arbitrarily long arithmetic progressions
• Polynomial configurations in the primes
• The structure of logarithmically averaged correlations of multiplicative functions, with applications to the Chowla and Elliott conjectures
• Higher uniformity of bounded multiplicative functions in short intervals on average
• Polynomial patterns in the 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
• The Green-Tao theorem for primes of the form \(x^2+y^2+1\)

This page was built for publication: The primes contain arbitrarily long polynomial progressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732174)