A note on small gaps between primes in arithmetic progressions
Deniz Ali Kaptan
TL;DR
This paper applies the Maynard-Tao method to study small gaps between primes within arithmetic progressions, providing bounds that are consistent across various moduli.
Contribution
It extends the Maynard-Tao approach to arithmetic progressions, offering uniform bounds over a range of moduli for small prime gaps.
Findings
Established bounds for small prime gaps in arithmetic progressions
Demonstrated uniformity of bounds over different moduli
Applied Maynard-Tao method to new setting
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.