Limit points and long gaps between primes

preprint2015arXivOpen access

Abstract

Let dn=pn+1−pnd_n = p_{n+1} - p_n, where pnp_n denotes the nnth smallest prime, and let R(T)=log⁡Tlog⁡2Tlog⁡4T/(log⁡3T)2R(T) = \log T \log_2 T\log_4 T/(\log_3 T)^2 (the "Erd{\H o}s--Rankin" function). We consider the sequence (dn/R(pn))(d_n/R(p_n)) of normalized prime gaps, and show that its limit point set contains at least 25%25\% of nonnegative real numbers. We also show that the same result holds if R(T)R(T) is replaced by any "reasonable" function that tends to infinity more slowly than R(T)log⁡3TR(T)\log_3 T. We also consider "chains" of normalized prime gaps. Our proof combines breakthrough work of Maynard and Tao on bounded gaps between primes with subsequent developments of Ford, Green, Konyagin, Maynard and Tao on long gaps between consecutive primes.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.