Zeta Zeros as the Edges of a Phase-Modulated PWM: Gram Ticks as a One-Shot Timer

We describe the classical machinery for locating zeros of ζ(1/2+it) in the language of an interval timer. The primes act as rotors with angular speeds log p; the Riemann–Siegel phase θ(t) is the timer hand; sign Z(t) is a pulse-width-modulated (PWM) square wave whose edges are exactly the zeros on the critical line; Gram points are the timer ticks; and evaluating Z once per tick is a one-shot trigger. In this dictionary, Gram's law, Rosser blocks and Turing's method become "one edge per tick", "a missed shot recovered in a neighbouring tick" and "edge count equals tick count". We give numerical data for the first 2288 zeros (t < 2815): 88% of Gram intervals contain exactly one zero, 94% of Gram points are good, and the mean position of a zero inside its Gram interval is 0.496. Finally we prove a tick–edge equivalence: the running average of (edge count − tick count) tends to 0 if and only if RH holds with simple zeros, and otherwise it is eventually ≤ −2; there is no intermediate value. This is an exact reformulation, not a proof of RH.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-15
DOI
https://doi.org/10.5281/zenodo.24239230
Primary Topic
Analytic Number Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Zeta Zeros as the Edges of a Phase-Modulated PWM: Gram Ticks as a One-Shot Timer

JeongMin Yeon
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

Zeta Zeros as the Edges of a Phase-Modulated PWM: Gram Ticks as a One-Shot Timer

JeongMin Yeon
preprint en

Abstract

We describe the classical machinery for locating zeros of ζ(1/2+it) in the language of an interval timer. The primes act as rotors with angular speeds log p; the Riemann–Siegel phase θ(t) is the timer hand; sign Z(t) is a pulse-width-modulated (PWM) square wave whose edges are exactly the zeros on the critical line; Gram points are the timer ticks; and evaluating Z once per tick is a one-shot trigger. In this dictionary, Gram's law, Rosser blocks and Turing's method become "one edge per tick", "a missed shot recovered in a neighbouring tick" and "edge count equals tick count". We give numerical data for the first 2288 zeros (t < 2815): 88% of Gram intervals contain exactly one zero, 94% of Gram points are good, and the mean position of a zero inside its Gram interval is 0.496. Finally we prove a tick–edge equivalence: the running average of (edge count − tick count) tends to 0 if and only if RH holds with simple zeros, and otherwise it is eventually ≤ −2; there is no intermediate value. This is an exact reformulation, not a proof of RH.

Zenodo (CERN European Organization for Nuclear Research)
Korea Aerospace University (KR)
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.

Laika access coming soon