Quantitative asymptotics for polynomial patterns in the primes
Mathematika · 2026-07 · 72 (3)
DOI: 10.1112/mtk.70103 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematika, online erschienen am 12.05.2026. Verfasst von Lilian Matthiesen und 2 weiteren Autor:innen. Die Arbeit nennt 22 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: European Research Council, Vetenskapsrådet.
Abstract (Originalsprache)
We prove quantitative estimates for averages of the von Mangoldt and Möbius functions along polynomial progressions for a large class of polynomials . The error terms obtained save an arbitrary power of logarithm, matching the classical Siegel–Walfisz error term. These results give the first quantitative bounds for the Tao–Ziegler polynomial patterns in the primes result. The proofs are based on a quantitative generalised von Neumann theorem of Peluse, a recent result of Leng on strong bounds for the Gowers uniformity of the primes, and analysis of a ‘Siegel model’ for the von Mangoldt function along polynomial progressions.
Förderung
- European Research Council
- Vetenskapsrådet
Zitieren
APA
Matthiesen, L., Teräväinen, J., & Wang, M. (2026). Quantitative asymptotics for polynomial patterns in the primes. Mathematika, 72(3). https://doi.org/10.1112/mtk.70103
Vancouver
Matthiesen L, Teräväinen J, Wang M. Quantitative asymptotics for polynomial patterns in the primes. Mathematika. 2026;72(3). doi:10.1112/mtk.70103
BibTeX
@article{Matthiesen2026,
author = {Matthiesen, Lilian and Teräväinen, Joni and Wang, Mengdi},
title = {Quantitative asymptotics for polynomial patterns in the primes},
journal = {Mathematika},
year = {2026},
volume = {72},
number = {3},
doi = {10.1112/mtk.70103}
}
EUVIMED