Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Prime Tuples and Siegel Zeros (2111.14054v5)

Published 28 Nov 2021 in math.NT

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

We haven't generated a summary for this paper yet.