Quantitative asymptotics for polynomial patterns in the primes

DOI10.1112/MTK.70103MaRDI QIDQ7254919zbMATH OpenFDO

Authors Lilian Matthiesen, Joni Teräväinen, Mengdi Wang

Publication date 29 May 2026

Published in Mathematika (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1112/MTK.70103

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 a Theorem of Van Der Corput
• An inverse theorem for the Gowers \(U^{s+1}[N]\)-norm
• Average Bateman–Horn for Kummer polynomials
• Bounds for sets with no polynomial progressions
• Elementary methods in the theory of L-functions, V. The theorems of Landau and Page
• Higher uniformity of bounded multiplicative functions in short intervals on average
• scientific article; zbMATH DE number 2137052 (Why is no real title available?)
• scientific article; zbMATH DE number 2121181 (Why is no real title available?)
• Linear equations in primes
• Opera de cribro
• Polynomial patterns in the primes
• Primes in higher-order progressions on average
• Primes in quadratic progressions on average
• Quantitative bounds for Gowers uniformity of the Möbius and von Mangoldt functions
• The Möbius function is strongly orthogonal to nilsequences
• The primes contain arbitrarily long arithmetic progressions
• The primes contain arbitrarily long polynomial progressions

This page was built for publication: Quantitative asymptotics for polynomial patterns in the primes

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