Skip to content
Preprint

An Almost-Covering Threshold for Golomb-Ruler Difference Packings

Aug 2026 · 0 citations · 12 references
Mathematics

Abstract

For a fixed integer $t\geq 3$, consider families of $t$-mark Golomb rulers whose positive-difference sets are pairwise disjoint and contained in $[1,U]$. Let $P_t(U)$ be the largest number of integers covered by such a family. We determine the threshold for asymptotically complete coverage: \[ P_t(U)=U-o(U) \quad\Longleftrightarrow\quad 3\leq t\leq 5. \] The cases $t=3,4$ follow from the known existence spectra for perfect difference families. For $t=5$, Wild's product construction, in the form recorded by Mathon and applied to perfect families of orders $121$ and $161$, gives a multiplicative semigroup of exact-covering scales; an elementary density lemma on its logarithms then supplies a scale $(1-o(1))U$ below every sufficiently large $U$. For the converse, we give a self-contained one-frequency Fourier obstruction. If $x_0\in(\pi,3\pi/2)$ is the first positive solution of $\tan x=x$ and \[ \gamma_0=-\frac{2\sin x_0}{x_0}=0.4344672564\ldots, \] then, for every fixed $t\geq 6$, \[ \liminf_{U\to\infty}\left(1-\frac{P_t(U)}{U}\right) \geq \frac{(t-1)\gamma_0-2}{2(t-2)}. \] In particular, the forced gap for six-mark rulers is at least $2.1542035\%$. We also prove a discrete small-difference bound which yields a stronger obstruction for every $t\geq14$ and forces a gap of \[ \frac12-\frac1{\sqrt t}-\frac7{8t}+O(t^{-3/2}) \] as $t\to\infty$.

View source

Similar papers

Jul 2026

A 64-Rectangle Counterexample to Wegner's Conjecture and LP Gaps up to 5/2

Wegner conjectured that every finite family $\mathcal R$ of axis-parallel rectangles satisfies $\tau(\mathcal R)\le 2\nu(\mathcal R)-1$, where $\nu$ is the packing number and $\tau$ is the piercing number. Ajwani, Gajjala, Raman, and Ray recently disproved this by constructing a triangle-free counterexample on $2196\cd...

Aranya Kumar Bal · 0 citations
Preprint Jul 2026

Self-Referential Leading Digits of Exponential Sequences: Arithmetic Structure and Certified Search

For $c>1$ and an integer radix $b\ge2$, we study the positive integers $m$ for which $mb^k\le c^m<(m+1)b^k$ for some $k\ge0$; for integer $c$, this is the self-prefix leading-digit condition. We derive an exact shrinking-target criterion; for $c\ge2$, an exact signed-discrepancy identity isolates both infinitude and th...

Zihan Fang · 0 citations
Preprint Aug 2026

Linear-Time Verification of Rings and Fields

This work gives a deterministic $O(n^2)$-time algorithm for ring verification and obtains a deterministic $O(n^2)$-time algorithm for field verification, resolving the deterministic complexity of this problem.

Youlong Ding · 0 citations
Review Aug 2026

Ramsey number $R(4, 20) \ge 252$

We exhibit two explicit circulant graphs of prime order $251$ that are $K_4$-free and have independence number $19$. Consequently \[R(4,20)\ge 252.\] These improve the bound $R(4,20)\ge 237$ given by Nagda, Raghavan, Thakurta and the long standing bound $R(4,21)\ge 242$ recorded in Radziszowski's dynamic survey. The gr...

Charlie Yu · 0 citations
Preprint Jul 2026

Largest Sperner families with restricted differences

Let $L$ be a fixed set of positive integers. A family $\mathcal{F}\subseteq 2^{[n]}$ is called $L$-differencing if $\lvert A\setminus B\rvert\in L$ for every ordered pair of distinct members $A,B\in\mathcal{F}$. A longstanding conjecture of Frankl, proposed in 1985, asserts that every $L$-differencing family has size a...

Gen-Nian Ge, Zixiang Xu, Xiao-Chen Zhao · 0 citations
Preprint Jul 2026

On Gr\"unbaum's problem for symmetric configurations

Let $g_n$ be the largest number of Euclidean balls of diameter $1$ which may be needed to cover a set of diameter $1$ in $\mathbb{R}^n$. We study this problem for finite sets invariant under all coordinate permutations. We prove that the exponential growth rate in this symmetric problem can be characterized exactly as...

Andrii Arman, A. Bondarenko, A. Prymak et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.