The primes contain arbitrarily long polynomial progressions
From MaRDI portal
(Redirected from Publication:732174)
Abstract: We establish the existence of infinitely many emph{polynomial} progressions in the primes; more precisely, given any integer-valued polynomials in one unknown with and any , we show that there are infinitely many integers with such that are simultaneously prime. The arguments are based on those in Green and Tao, which treated the linear case and ; 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.
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
Cites work
- scientific article; zbMATH DE number 3968684 (Why is no real title available?)
- scientific article; zbMATH DE number 3719449 (Why is no real title available?)
- scientific article; zbMATH DE number 3480719 (Why is no real title available?)
- scientific article; zbMATH DE number 1315276 (Why is no real title available?)
- scientific article; zbMATH DE number 1989994 (Why is no real title available?)
- scientific article; zbMATH DE number 871718 (Why is no real title available?)
- A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
- A new proof of Szemerédi's theorem
- A polynomial Sárközy-Furstenberg theorem with upper bounds
- A variant of the hypergraph removal lemma
- AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM
- Additive properties of dense subsets of sifted sequences
- An ergodic Szemerédi theorem for commuting transformations
- Arithmetic progressions in prime numbers (after B. Green and T. Tao)
- Aspects of uniformity in recurrence
- Combinatorial Nullstellensatz
- Convergence of multiple ergodic averages along polynomials of several variables
- Convergence of polynomial ergodic averages
- Difference sets without -th powers
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- La conjecture de Weil. I
- La conjecture de Weil. II
- Linear equations in primes
- Obstructions to uniformity and arithmetic patterns in the primes
- On Certain Sets of Positive Density
- On Sets of Natural Numbers Whose Difference Set Contains No Squares
- On arithmetic structures in dense sets of integers
- On difference sets of sequences of integers. I
- On sets of integers containing k elements in arithmetic progression
- Polynomial averages converge to the product of integrals
- Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
- The Gaussian primes contain arbitrarily shaped constellations
- The primes contain arbitrarily long arithmetic progressions
- Weakly mixing PET
Cited in
(58)- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- More primes and polynomials
- Narrow arithmetic progressions in the primes
- Polynomial configurations in subsets of random and pseudo-random sets
- A Hardy field extension of Szemerédi's theorem
- 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
- Enveloping sieve related to the Hardy-Littlewood irreducible tuple conjecture in a function field
- A transference principle for systems of linear equations, and applications to almost twin primes
- Almost prime solutions to diophantine systems of high rank
- Polynomial extensions of the Milliken-Taylor theorem
- Roth's theorem in the primes
- The ABC conjecture, arithmetic progressions of primes and squarefree values of polynomials at prime arguments
- 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
- Arithmetic progressions in prime numbers (after B. Green and T. Tao)
- Patterns of primes in Chebotarev sets
- The complexity of differential privacy
- Arithmetic and polynomial progressions in the primes [after Gowers, Green, Tao and Ziegler]
- Advice lower bounds for the dense model theorem
- Some open problems on multiple ergodic averages
- Small gaps between configurations of prime polynomials
- The primes contain arbitrarily long arithmetic progressions
- A view on multiple recurrence
- From harmonic analysis to arithmetic combinatorics
- 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
- Bounds for sets with no polynomial progressions
- Quantitative bounds in the polynomial Szemerédi theorem: the homogeneous case
- Joint ergodicity of fractional powers of primes
- 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
- Intersective polynomials and the primes
- An arithmetic transference proof of a relative Szemerédi theorem
- The structure of logarithmically averaged correlations of multiplicative functions, with applications to the Chowla and Elliott conjectures
- The Chen primes contain arbitrarily long arithmetic progressions
- Polynomial configurations in the primes
- Higher uniformity of bounded multiplicative functions in short intervals on average
- Multiple recurrence and convergence for Hardy sequences of polynomial growth
- Polynomial patterns in the primes
- The Green-Tao theorem for primes of the form \(x^2+y^2+1\)
- 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
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)