Three-share quintuples are never near-tight, and the loneliness of the Fan-Sun towers

For distinct positive integers v₁, …, vₙ let ML = maxₜ minᵢ ‖t vᵢ‖, where ‖x‖ is the distance from x to the nearest integer. Call a quintuple of speeds three-share at g if three of its speeds are divisible by g and the other two are coprime to g. We prove that a quintuple that is three-share at some g ≥ 3 has ML ≥ 1/5, with no exceptions. The bound is attained, and it fails at g = 2. By Cordella's work (arXiv:2609.03444), every near-tight quintuple (ML < 1/5) outside a finite set E₅ lies in one of two explicit families, so E₅ contains no quintuple that is three-share at a modulus g ≥ 3. Yi, Gill and Bu have since bounded E₅ effectively; this result is an exception-free constraint on its shape. The proof is short and uses no Lonely Runner input. Its ingredients are an annulus lemma (any three positive integers have a common time at which each lies between 1/5 and 2/5 from the nearest integer) and a doubling lemma for the moduli 3, 4, 6 and 8. The counting step is formalized in Lean 4, together with the theorem for g ≥ 5 taking the Lonely Runner Conjecture for three and four speeds (both known) as hypotheses, and the case g = 8 without them, from a point supplied by the annulus lemma, which is not formalized. We also give the exact maximum loneliness of Fan and Sun's towers {a, b, a+b, …, (l−2)a+b} of length l ≥ 5 for even a, and for odd a when l ≤ 22, and show that every such tower satisfies the Lonely Runner Conjecture. Files: the note (PDF), and a supplementary archive with the full proofs, the exact verifiers and their tests, two certificates with standalone checkers, and the Lean 4 files; its README says how to run each check. The mathematics, the code and the text were produced by Claude, an AI model made by Anthropic, working in the author's research workspace; the note's last section says how. No human expert has refereed it.

Authors

Publication Details

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

Three-share quintuples are never near-tight, and the loneliness of the Fan-Sun towers

Adam Oliner
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

Three-share quintuples are never near-tight, and the loneliness of the Fan-Sun towers

Adam Oliner
preprint en

Abstract

For distinct positive integers v₁, …, vₙ let ML = maxₜ minᵢ ‖t vᵢ‖, where ‖x‖ is the distance from x to the nearest integer. Call a quintuple of speeds three-share at g if three of its speeds are divisible by g and the other two are coprime to g. We prove that a quintuple that is three-share at some g ≥ 3 has ML ≥ 1/5, with no exceptions. The bound is attained, and it fails at g = 2. By Cordella's work (arXiv:2609.03444), every near-tight quintuple (ML < 1/5) outside a finite set E₅ lies in one of two explicit families, so E₅ contains no quintuple that is three-share at a modulus g ≥ 3. Yi, Gill and Bu have since bounded E₅ effectively; this result is an exception-free constraint on its shape. The proof is short and uses no Lonely Runner input. Its ingredients are an annulus lemma (any three positive integers have a common time at which each lies between 1/5 and 2/5 from the nearest integer) and a doubling lemma for the moduli 3, 4, 6 and 8. The counting step is formalized in Lean 4, together with the theorem for g ≥ 5 taking the Lonely Runner Conjecture for three and four speeds (both known) as hypotheses, and the case g = 8 without them, from a point supplied by the annulus lemma, which is not formalized. We also give the exact maximum loneliness of Fan and Sun's towers {a, b, a+b, …, (l−2)a+b} of length l ≥ 5 for even a, and for odd a when l ≤ 22, and show that every such tower satisfies the Lonely Runner Conjecture. Files: the note (PDF), and a supplementary archive with the full proofs, the exact verifiers and their tests, two certificates with standalone checkers, and the Lean 4 files; its README says how to run each check. The mathematics, the code and the text were produced by Claude, an AI model made by Anthropic, working in the author's research workspace; the note's last section says how. No human expert has refereed it.

Zenodo (CERN European Organization for Nuclear Research)
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