Search arXivSearch

arXiv · 2604.25214

Size-4 Counterexamples to the Sidon-Extension Conjecture

Abstract

A finite set $S \subset \mathbb{Z}$ is a Sidon set if its pairwise differences are distinct. Recall that a perfect difference set (PDS) of order $n$ is a set $B \subset \mathbb{Z}_v$ ($v = n^2 - n + 1$) of size $n$ such that every nonzero residue arises exactly once as a difference of two elements of $B$. Erdő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 $\{1,2,4,8,13\}$ and Hall's earlier $\{1,3,9,10,13\}$; they then asked: what is the smallest size $s$ of a non-extending Sidon set? The trivial bounds give $3 \le s \le 5$. Our evidence points to $s = 4$. 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 $kA$, $kB$ and their reflections, all of which fail to extend for every prime power $q \le 317$ via the Singer affine-orbit check (rigorous under Hall's 1947 uniqueness for Desarguesian cyclic planes through $q \le 40$ and under the prime-power conjecture beyond that), and unconditionally for every modulus $v \le 133$ via brute-force depth-first search. We also report the exact density $N_{\text{ne}}(N) = 4 \lfloor N / 11 \rfloor$ of non-extending size-4 Sidon sets in $[0, N]$ for $N \le 50$ -- the match is exact, which suggests the $kA, kB$ family is complete in this range. A complete proof, perhaps in the spirit of Alexeev--Mixon's polarity argument or via a multiplier descent, remains open.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tong Niu. 2026-05-14. Size-4 Counterexamples to the Sidon-Extension Conjecture. https://arxiv.org/abs/2604.25214

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO