Papers
Topics
Authors
Recent
Search
2000 character limit reached

Prime Tuples and Siegel Zeros

Published 28 Nov 2021 in math.NT | (2111.14054v5)

Abstract: Under the assumption of infinitely many Siegel zeroes $s$ with $Re(s)>1-\frac{1}{(\log q){R}}$ for a sufficiently large value of $R$, we prove that there exist infinitely many $m$-tuples of primes that are $\ll e{1.9828m}$ apart. This "improves" (in some sense) on the bounds of Maynard-Tao, Baker-Irving, and Polymath 8b, who found bounds of $e{3.815m}$ unconditionally and $me{2m}$ assuming the Elliott-Halberstam conjecture; it also generalizes a 1983 result of Heath-Brown that states that infinitely many Siegel zeroes would imply infinitely many twin primes. Under this assumption of Siegel zeroes, we also improve the upper bounds for the gaps between prime triples, quadruples, quintuples, and sextuples beyond the bounds found via Elliott-Halberstam.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.