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ő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, together with the apparent infinite family of dilations , and their reflections, all of which fail to extend for every prime power via the Singer affine-orbit check (rigorous under Hall’s 1947 uniqueness for Desarguesian cyclic planes through and under the prime-power conjecture beyond that), and unconditionally for every modulus via brute-force depth-first search. We also report the exact density of non-extending size-4 Sidon sets in for – the match is exact, which suggests the 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本