THE DISTRIBUTION OF PRIME NUMBERS IN SHORT INTERVALS

In this thesis, we focus on the problem of primes in short intervals. We will explore the main ingredients in the works by Ingham (1937), Heath-Brown and Iwaniec (1979), and Baker and Harman (1996), such as zero-density estimates, their weighted variation, and sieve methods. In Chapter 2, we will provide a generalised version of Ingham's theorem, which connects the classical zero-density estimates with primes in short intervals; our version of the theorem explicitly shows the dependence of a short interval length on the combination of the zero-free regions and the zero-density estimates. In Chapter 3, we introduce the weighted zero-density estimates due to Heath-Brown and Iwaniec, which allow one to avoid the bottlenecks of the classical approach and are used in the paper by Baker and Harman in a slightly different variation. We generalise and simplify the results by Heath-Brown and Iwaniec, explain how to switch from their variation to the variation by Baker and Harman and provide an improvement for the weighted zero-density estimates using the current classical zero-density estimates. Chapter 4 is devoted to sieve methods and Harman's comparison principle, which connects the estimates for rough numbers in short and long intervals. In addition, we prove the asymptotic for rough numbers in the sets where the prime number theorem holds --- this result allows us to shrink the length of the interval with the asymptotic for rough numbers to $x^{7/12}$. In Chapter 5, we introduce the asymptotic for the weighted sums for prime-counting functions with parameters restricted to dyadic intervals. These results are crucial for the complete understanding of the final proof by Baker and Harman, which we explain in detail in Chapter 6. Finally, we introduce an optimisation problem which, once resolved, will refine the result from the paper by Baker and Harman with the use of the generalised techniques introduced in the thesis.

Authors

Institutions

Publication Details

Journal
Bulletin of the Australian Mathematical Society
Published
2024-11-25
DOI
https://doi.org/10.1017/s0004972724000996
Primary Topic
Numerical Methods and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

THE DISTRIBUTION OF PRIME NUMBERS IN SHORT INTERVALS

Valeriia V. Starichkova
Bulletin of the Australian Mathematical Society
Numerical Methods and Algorithms
article

THE DISTRIBUTION OF PRIME NUMBERS IN SHORT INTERVALS

Valeriia V. Starichkova
article en

Abstract

In this thesis, we focus on the problem of primes in short intervals. We will explore the main ingredients in the works by Ingham (1937), Heath-Brown and Iwaniec (1979), and Baker and Harman (1996), such as zero-density estimates, their weighted variation, and sieve methods. In Chapter 2, we will provide a generalised version of Ingham's theorem, which connects the classical zero-density estimates with primes in short intervals; our version of the theorem explicitly shows the dependence of a short interval length on the combination of the zero-free regions and the zero-density estimates. In Chapter 3, we introduce the weighted zero-density estimates due to Heath-Brown and Iwaniec, which allow one to avoid the bottlenecks of the classical approach and are used in the paper by Baker and Harman in a slightly different variation. We generalise and simplify the results by Heath-Brown and Iwaniec, explain how to switch from their variation to the variation by Baker and Harman and provide an improvement for the weighted zero-density estimates using the current classical zero-density estimates. Chapter 4 is devoted to sieve methods and Harman's comparison principle, which connects the estimates for rough numbers in short and long intervals. In addition, we prove the asymptotic for rough numbers in the sets where the prime number theorem holds --- this result allows us to shrink the length of the interval with the asymptotic for rough numbers to $x^{7/12}$. In Chapter 5, we introduce the asymptotic for the weighted sums for prime-counting functions with parameters restricted to dyadic intervals. These results are crucial for the complete understanding of the final proof by Baker and Harman, which we explain in detail in Chapter 6. Finally, we introduce an optimisation problem which, once resolved, will refine the result from the paper by Baker and Harman with the use of the generalised techniques introduced in the thesis.

Bulletin of the Australian Mathematical SocietyVol. 111(1)
University of Canberra (AU), UNSW Canberra
Quality Education
Openalex Percentile: Top 75%
Numerical Methods and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.