A note on small gaps between primes in arithmetic progressions

From MaRDI portal



Abstract: We implement the Maynard-Tao method of detecting primes in tuples to investigate small gaps between primes in arithmetic progressions, with bounds that are uniform over a range of moduli.


Recently, by modifying the method of Goldston-Pintz-Yıldırım, \textit{J. Maynard} [Ann. Math. (2) 181, No. 1, 383--413 (2015; Zbl 1306.11073)] and Tao (independently) gave a method to detect \(m\) primes in admissible \(k\)-tuples for any \(m\), if \(k\) is large enough. In the present paper, the author modifies the method to get alike results concerning primes in an arithmetic progression. Then several results are obtained concerning gaps between consecutive primes in arithmetic progressions. The key ingredient in the proofs is a Bombieri-Vinogradov-type theorem.











This page was built for publication: A note on small gaps between primes in arithmetic progressions

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