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
- Ariel Williams
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