Asymptotics for some polynomial patterns in the primes

DOI10.1017/PRM.2018.52MaRDI QIDQ5244483zbMATH OpenOpenAlexFDO

Authors Pierre-Yves Bienvenu

Publication date 21 November 2019

Published in Proceedings of the Royal Society of Edinburgh: Section A Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

configurations of primesGreen-Tao methodprime values of polynomials

Mathematics Subject Classification ID

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

Abstract: We prove asymptotic formulae for sums of the form ${\displaystyle }$ sum_{ninmathbb{Z}^dcap K}prod_{i=1}^tF_i(psi_i(n)), ${\displaystyle }$ where $K$ is a convex body, each $F_i$ is either the von Mangoldt function or the representation function of a quadratic form, and $Psi=(ps{i}_1,ldots,ps{i}_t)$ is a system of linear forms of finite complexity. When all the functions $F_i$ are equal to the von Mangoldt function, we recover a result of Green and Tao, while when they are all representation functions of quadratic forms, we recover a result of Matthiesen. Our formulae imply asymptotics for some polynomial patterns in the primes. Specifically, they describe the asymptotic behaviour of the number of $k$-term arithmetic progressions of primes whose common difference is a sum of two squares. The article combines ingredients from the work of Green and Tao on linear equations in primes and that of Matthiesen on linear correlations amongst integers represented by a quadratic form. To make the von Mangoldt function compatible with the representation function of a quadratic form, we provide a new pseudorandom majorant for both -- an average of the known majorants for each of the functions -- and prove that it has the required pseudorandomness properties.

Recommendations

• Polynomial patterns in the primes
• Primes in arithmetic progressions to large moduli. II
• Linear equations in primes
• The primes contain arbitrarily long polynomial progressions
• Polynomial differences in the primes

Cites work

• An inverse theorem for the Gowers \(U^{s+1}[N]\)-norm
• Correlations of the divisor function
• scientific article; zbMATH DE number 2121181 (Why is no real title available?)
• scientific article; zbMATH DE number 3182297 (Why is no real title available?)
• Linear correlations amongst numbers represented by positive definite binary quadratic forms
• Linear equations in primes
• Norm forms for arbitrary number fields as products of linear polynomials
• On arithmetic structures in dense sets of integers
• On the Sum ∑k=1xd(f(k))
• Polynomial configurations in the primes
• Sur le problème des diviseurs de Titchmarsh.
• The Green-Tao theorem: an exposition
• The Möbius function is strongly orthogonal to nilsequences
• The primes contain arbitrarily long arithmetic progressions
• The primes contain arbitrarily long polynomial progressions

Cited in

(2)

• Polynomial patterns in the primes
• Polynomial differences in the primes

This page was built for publication: Asymptotics for some polynomial patterns in the primes

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