Size-4 Counterexamples to the Sidon-Extension Conjecture
Tong Niu

TL;DR
This paper presents explicit size-4 Sidon sets that do not extend to perfect difference sets, providing evidence that the minimal non-extending size is four, and reports exact counts of such sets up to N=50.
Contribution
It exhibits concrete size-4 Sidon sets that cannot be extended to perfect difference sets and analyzes their density, advancing understanding of the Sidon-Extension Conjecture.
Findings
Explicit size-4 Sidon sets that do not extend to PDS.
Exact density of non-extending size-4 Sidon sets in [0, N] for N ≤ 50.
Evidence suggesting the minimal non-extending size is four.
Abstract
A finite set is a Sidon set if its pairwise differences are distinct. Recall that a perfect difference set (PDS) of order is a set () of size such that every nonzero residue arises exactly once as a difference of two elements of . Erd\H{o}s's $1000 conjecture -- that every finite Sidon set extends to a finite PDS -- was disproved by Alexeev and Mixon (arXiv:2510.19804, October 2025), via the size-5 counterexamples and Hall's earlier ; they then asked: what is the smallest size of a non-extending Sidon set? The trivial bounds give . Our evidence points to . We exhibit two integer Sidon sets, \[ A = \{0, 1, 3, 11\}, \qquad B = \{0, 1, 4, 11\}, \] together with the apparent infinite family of dilations , and their reflections, all of which fail…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
