Polynomial patterns in the primes

DOI10.1017/FMP.2017.3zbMATH Open1459.11030OpenAlexW2963980262MaRDI QIDQ5226582FDOQ5226582

Authors: Tamar Ziegler, Terence Tao 

Publication date: 1 August 2019

Published in: Forum of Mathematics, Pi (Search for Journal in Brave)

Abstract: Let $$ be polynomials of degree at most $d$ for some $dgeq1$, with the degree $d$ coefficients all distinct, and admissible in the sense that for every prime $p$, there exists integers $n,m$ such that $n+P_1(m),dots,n+P_k(m)$ are all not divisible by $p$. We show that there exist infinitely many natural numbers $n,m$ such that $n+P_1(m),dots,n+P_k(m)$ are simultaneously prime, generalizing a previous result of the authors, which was restricted to the special case $P_1(0)=dots=P_k(0)=0$ (though it allowed for the top degree coefficients to coincide). Furthermore, we obtain an asymptotic for the number of such prime pairs $n,m$ with $nleqN$ and $mleqM$ with $M$ slightly less than $N^{1/d}$. Our arguments rely on four ingredients. The first is a (slightly modified) generalized von Neumann theorem of the authors, reducing matters to controlling certain averaged local Gowers norms of (suitable normalizations of) the von Mangoldt function. The second is a more recent concatenation theorem of the authors, controlling these averaged local Gowers norms by global Gowers norms. The third ingredient is the work of Green and the authors on linear equations in primes, allowing one to compute these global Gowers norms for the normalized von Mangoldt functions. Finally, we use the Conlon-Fox-Zhao densification approach to the transference principle to combine the preceding three ingredients together. In the special case $P_1(0)=dots=P_k(0)=0$, our methods also give infinitely many $n,m$ with $n+P_1(m),dots,n+P_k(m)$ in a specified set primes of positive relative density $delta$, with $m$ bounded by $lo{g}^{L}n$ for some $L$ independent of the density $delta$. This improves slightly on a result from our previous paper, in which $L$ was allowed to depend on $delta$.

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

Recommendations

• The primes contain arbitrarily long polynomial progressions
• Polynomial differences in the primes
• Asymptotics for some polynomial patterns in the primes
• Linear equations in primes

zbMATH Keywords

patterns of primes

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30) Primes represented by polynomials; other multiplicative structures of polynomial values (11N32)

Cites Work

• A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
• A new proof of Szemerédi's theorem
• A new proof of Szemerédi's theorem for arithmetic progressions of length four
• A relative Szemerédi theorem
• An averaged form of Chowla's conjecture
• An inverse theorem for the Gowers \(U^{s+1}[N]\)-norm
• Concatenation theorems for anti-Gowers-uniform functions and Host-Kra characteristic factors
• Decompositions, approximate structure, transference, and the Hahn-Banach theorem
• Diophantine equations in the primes
• Intersective polynomials and the primes
• Large gaps between consecutive prime numbers
• Linear equations in primes
• Multiplicative functions in short intervals
• On sets of integers containing k elements in arithmetic progression
• On the difference between consecutive primes
• On the representation of large odd integer as a sum of three almost equal primes
• Opera de cribro
• Polynomial configurations in the primes
• Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
• Primes in short arithmetic progressions
• Sur certaines hypothèses concernant les nombres premiers
• The Möbius function is strongly orthogonal to nilsequences
• The primes contain arbitrarily long arithmetic progressions
• The primes contain arbitrarily long polynomial progressions
• The quantitative behaviour of polynomial orbits on nilmanifolds
• The true complexity of a system of linear equations

Cited In (16)

• Regularity of primes associated with polynomial parametrisations
• More primes and polynomials
• Asymptotics for some polynomial patterns in the primes
• Polynomials and Primes in Generalized Arithmetic Progressions
• Patterns of primes in Chebotarev sets
• Uniformity norms, their weaker versions, and applications
• A view on multiple recurrence
• Polynomial differences in the primes
• Small gaps between configurations of prime polynomials
• Bounds for sets with no polynomial progressions
• A polynomial Roth theorem on the real line
• Small sets containing any pattern
• Further bounds in the polynomial Szemerédi theorem over finite fields
• Polynomial configurations in the primes
• Sets of primes determined by systems of polynomial congruences
• Higher uniformity of bounded multiplicative functions in short intervals on average

This page was built for publication: Polynomial patterns in the primes

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