Pair correlation conjecture for the zeros of the Riemann zeta‐function I: Simple and critical zeros

Abstract Montgomery in 1973 introduced the pair correlation conjecture (PCC) for zeros of the Riemann zeta‐function. He also conjectured that asymptotically 100% of the zeros are simple. His reasoning to support these two conjectures used the Riemann hypothesis (RH). Building on Montgomery's approach, Gallagher and Mueller proved in 1978 that PCC under RH implies that 100% of the zeros are simple. Actually, the method of Gallagher and Mueller does not depend on RH, and thus Montgomery's second simplicity conjecture follows from his PCC conjecture without additionally assuming RH. We clarify this result by explicitly not assuming RH and considering PCC as a conjecture only concerning the vertical distribution of zeros. We then show that, for the first time, PCC can also be used to obtain information on the horizontal distribution of zeros. Using Gallagher and Mueller's method and a new idea concerning “horizontal multiplicity,” we use PCC to prove that asymptotically 100% of the zeros are not only simple but also on the critical line.

Authors

Institutions

Publication Details

Journal
Mathematika
Published
2026-09-09
DOI
https://doi.org/10.1112/mtk.70127
Primary Topic
Analytic Number Theory Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Pair correlation conjecture for the zeros of the Riemann zeta‐function I: Simple and critical zeros

D. A. Goldston, Jordan Schettler, Ade Irma Suriajaya, Junghun Lee
Mathematika
Analytic Number Theory Research
article

Pair correlation conjecture for the zeros of the Riemann zeta‐function I: Simple and critical zeros

D. A. Goldston, Jordan Schettler, Ade Irma Suriajaya, Junghun Lee
article en

Abstract

Abstract Montgomery in 1973 introduced the pair correlation conjecture (PCC) for zeros of the Riemann zeta‐function. He also conjectured that asymptotically 100% of the zeros are simple. His reasoning to support these two conjectures used the Riemann hypothesis (RH). Building on Montgomery's approach, Gallagher and Mueller proved in 1978 that PCC under RH implies that 100% of the zeros are simple. Actually, the method of Gallagher and Mueller does not depend on RH, and thus Montgomery's second simplicity conjecture follows from his PCC conjecture without additionally assuming RH. We clarify this result by explicitly not assuming RH and considering PCC as a conjecture only concerning the vertical distribution of zeros. We then show that, for the first time, PCC can also be used to obtain information on the horizontal distribution of zeros. Using Gallagher and Mueller's method and a new idea concerning “horizontal multiplicity,” we use PCC to prove that asymptotically 100% of the zeros are not only simple but also on the critical line.

MathematikaVol. 72(4)
Chonnam National University (KR), Gwangju National University of Education (KR), Kyushu University (JP), San Jose State University (US)
American Institute of Mathematics, National Research Foundation, National Research Foundation of Korea, Ministry of Science and ICT, South Korea, Japan Society for the Promotion of Science
Openalex Percentile: Top 93%
Analytic Number Theory Research
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.