On the ratio of consecutive gaps between primes
Janos Pintz

TL;DR
This paper generalizes recent results on bounded prime gaps and large prime gaps, addressing a longstanding question of whether the ratio of consecutive prime gaps can be arbitrarily small or large infinitely often.
Contribution
It proves a unified result extending Maynard-Tao's work and Erdős-Rankin bounds, resolving a 60-year-old problem about the ratios of consecutive prime gaps.
Findings
The ratio of consecutive prime gaps can be arbitrarily small infinitely often.
The ratio of consecutive prime gaps can be arbitrarily large infinitely often.
Provides a strong affirmative answer to Erdős's long-standing question.
Abstract
In the present work we prove a common generalization of Maynard-Tao's recent result about consecutive bounded gaps between primes and on the Erd\H{o}s-Rankin bound about large gaps between consecutive primes. The work answers in a strong form a 60 years old problem of Erd\"os, which asked whether the ratio of two consecutive primegaps can be infinitely often arbitrarily small, and arbitrarily large, respectively.
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.
Taxonomy
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory
