Narrow arithmetic progressions in the primes

DOI10.1093/IMRN/RNV393MaRDI QIDQ4611872zbMATH OpenOpenAlexFDO

Authors Xuancheng Shao

Publication date 22 January 2019

Published in IMRN. International Mathematics Research Notices (Search for Journal in Brave)

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

zbMATH Keywords

arithmetic progressionspseudorandomnessSzemerédi's theorem

Mathematics Subject Classification ID

Distribution of primes (11N05) Primes (11A41) Primes in congruence classes (11N13)

Abstract: We study arithmetic progressions in primes with common differences as small as possible. Tao and Ziegler showed that, for any $kgeq3$ and $N$ large, there exist non-trivial $k$-term arithmetic progressions in (any positive density subset of) the primes up to $N$ with common difference $O((logN{)}^{L_k})$, for an unspecified constant $L_k$. In this work we obtain this statement with the precise value $L_k=(k-1)2^{k-2}$. This is achieved by proving a relative version of Szemer'{e}di's theorem for narrow progressions requiring simpler pseudorandomness hypotheses in the spirit of recent work of Conlon, Fox, and Zhao.

Recommendations

• The primes contain arbitrarily long polynomial progressions
• A relative Szemerédi theorem
• Szemerédi's Theorem in the Primes
• The primes contain arbitrarily long arithmetic progressions

Cited in

(2)

• The most likely common difference of arithmetic progressions among primes
• Szemerédi's Theorem in the Primes

This page was built for publication: Narrow arithmetic progressions in the primes

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