The sharp asymptotic diameter of linear-multiplicity rulers

A linear-multiplicity ruler is a finite set of integers in which each positive distance d occurs at most d − 1 times. This paper proves that the minimum diameter L(n) of an n-mark linear-multiplicity ruler is asymptotic to (2√2/3)n^(3/2), matching the lower bound of Aditya Gupta and Kevin O’Bryant. The upper bound uses independent blocks of four gaps. A rational polynomial estimate controls the expected counts at distances that can span several blocks. The paper also determines the leading asymptotic for the first-attainment threshold g₀(b) in Gupta and O’Bryant’s formula G(g, g+b) = g + 2b − 2 for high-multiplicity Golomb rulers. It proves g₀(b) ∼ (2√2/3)b^(3/2) and shows that the equality holds for every g ≥ g₀(b). The supporting archive contains the paper, LaTeX source, exact rational coefficient tables, build instructions, and a Python standard-library script that regenerates and checks the arithmetic certificate.

Authors

Publication Details

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

The sharp asymptotic diameter of linear-multiplicity rulers

Ariel Williams
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

The sharp asymptotic diameter of linear-multiplicity rulers

Ariel Williams
preprint en

Abstract

A linear-multiplicity ruler is a finite set of integers in which each positive distance d occurs at most d − 1 times. This paper proves that the minimum diameter L(n) of an n-mark linear-multiplicity ruler is asymptotic to (2√2/3)n^(3/2), matching the lower bound of Aditya Gupta and Kevin O’Bryant. The upper bound uses independent blocks of four gaps. A rational polynomial estimate controls the expected counts at distances that can span several blocks. The paper also determines the leading asymptotic for the first-attainment threshold g₀(b) in Gupta and O’Bryant’s formula G(g, g+b) = g + 2b − 2 for high-multiplicity Golomb rulers. It proves g₀(b) ∼ (2√2/3)b^(3/2) and shows that the equality holds for every g ≥ g₀(b). The supporting archive contains the paper, LaTeX source, exact rational coefficient tables, build instructions, and a Python standard-library script that regenerates and checks the arithmetic certificate.

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