Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Symmetric reformulations
Positive-half characterization
Let be a finite set. Then has unique unordered sums away from zero if and only if
Indeed the positive sums from are sums from and positive differences from . Sidon uniqueness makes each of these types individually unique, and the disjointness prevents cross-type collisions. The negative sums follow by reflection. Conversely each requirement follows immediately from uniqueness for .
The second condition in (1) is equivalent to
Thus the fully symmetric part of the target would follow from
for Sidon, -sum-free sets . This statement has not been proved here. Taking a dense Sidon set in attains the proposed constant.
If zero is also to be included in , one must additionally require . Omitting this condition is not legitimate, although deleting a single central element from an existing example does not affect its leading size.
Modular lifting
Call symmetric Sidon with center zero if , and every nontrivial equality of two unordered pair sums has common sum zero. If and has no nonzero element of order two, choose its centered representatives in . Modular nonexceptional sum uniqueness implies integer nonexceptional sum uniqueness. An exceptional sum is a multiple of , but the integer pair sums lie in , so it can only be zero. The representatives can be translated into .
In particular a cyclic symmetric Sidon family with would disprove the interval conjecture. No such family was found.
The modulus-three construction
Let be modular Sidon, with . In , put
The two same-copy sum types and the mixed type have distinct first coordinates. Nonzero mixed sums are unique because nonzero differences in are unique. Thus is symmetric Sidon. Under CRT it gives an admissible integer set of size in . Ordinary modular Sidon sets of size reproduce the constant .
This construction also cautions against assuming that equality requires points near the two ends of an interval. For example take a Singer difference set with , , and , so . The difference-set identity gives at every nonprincipal character. For every fixed nonzero integer Fourier frequency on , the component is nonprincipal for all sufficiently large . The normalized Fourier coefficient of is therefore . Weyl's criterion gives uniform macroscopic distribution of the representatives in . For the standard Singer construction, see §3.4 and entry [4] of source record. Its Sidon property and show that every nonzero difference occurs exactly once, which proves the character identity used above. No upper bound in these notes uses this construction.
Four-independence and a related conjecture
A subset of an abelian group is four-independent if and imply that all integer vanish. For disjoint from , the following characterization holds:
For the reverse implication, convert a signed relation of length at most four to an equality between two pairs, using signs to put each term in and padding with zero. A trivial pair equality, or an equality in which both pairs are opposite pairs, makes all coefficients cancel. For the forward implication, any forbidden pair equality gives a nontrivial signed relation of length at most four.
Bajnok–Ruzsa, The independence number of a subset of an abelian group, Integers 3 (2003), A02, Corollary 3.2 and Conjecture 3.3, prove bounds
and conjecture . See the full primary paper, pp. 15–16. This is a related conjecture, not a theorem proving the target.
The map taking the standard basis to the elements of is injective on the Lee ball of radius two exactly when is four-independent. That ball has elements. Thus a cyclic lattice packing density asymptotically greater than would yield a counterexample through (3) and centered lifting. If the map is not onto, use its image as the quotient; its order, rather than , is the packing denominator.
Xiao–Zhou, On the packing density of Lee spheres (2024), advertise radius-two lattice packings with density tending to , not a larger value. The publisher abstract does not determine the cyclicity of their quotients or the details of their construction. No result in these notes relies on that construction.
The relation to four-independence is not an equivalence for a symmetric set without zero. In the positive-half formulation, equations may occur. Their supports are pairwise disjoint: a shared output violates Sidon uniqueness, a shared input repeats a difference, and an output used as another input contradicts (2). Nevertheless, there can be a positive proportion of such disjoint relations, so no negligible-deletion reduction has been proved.
A local endpoint-cover construction criterion
The asymmetric endpoint formulation also permits deletion of individual signs. It gives a sparse construction with a strict signed-cover saving and a sharp continuum obstruction to macroscopic versions of that saving.
Let be ordinary Sidon and let be an integer. Set
Then is Sidon, and is equivalent to requiring that meet the support of every relation
Repeated inputs are permitted. Every input in such a relation belongs to , and the output belongs to . This follows immediately from nonnegativity and .
The symmetric set lies in an interval of span . Since is an integer or half-integer, a translation puts it in an integer interval of length . If and , this construction would beat the target provided, for a fixed positive margin,
For small fixed , the required proportion is .
Deleting all of is a valid cover: the remaining three inputs have sum greater than . For an asymptotically maximal Sidon set in , uniform distribution makes this cost , twice the first-order allowance in (5). No nongeometric cover meeting (5) was constructed. The criterion isolates a possible integer-only route; it supplies no asymptotic improvement by itself.
The second-order construction does use this criterion successfully when . Averaging over permits deletion of only outputs and proves a positive gain over the reflected lower bound along an unbounded sequence. It does not handle fixed positive .
There is also a limitation on replacing the geometric cover by another macroscopic region. In normalized endpoint coordinates, let measurable be the deleted input and output regions. Suppose they cover every relation
The diagonal relations show that
The same conclusion holds if coverage is required only almost everywhere on the three-dimensional relation hypersurface. Otherwise there is a density point of the surviving inputs for which is a density point of the surviving outputs. Three small near-full neighborhoods of , together with a near-full neighborhood of , produce a positive-measure family of uncovered relations, a contradiction.
Thus, in a continuum model with uniform endpoint densities, arbitrary macroscopic deletion regions still cost at least when . This is a theorem about the stated continuum cover, not an integer obstruction: passing from arithmetic covers of a sparse Sidon set to this continuum hypothesis would require the missing four-variable transfer. A successful fixed-proportion compression would have to exploit information absent from this macroscopic model.
A conditional pair-incidence obstruction to compression
There is a weaker sufficient transfer hypothesis than full four-variable mixing. The following implication is proved, but its hypotheses have not been established for the proposed Singer endpoint constructions.
Suppose , , and the endpoint empirical measures of are uniform. Form the hypergraph of relations (4) with three distinct input vertices. For a cover , write for limiting deleted densities in coordinates at the lower endpoint and at the upper endpoint. Put , . Let be the edge count, the deleted lower- and upper-vertex incidences, and the count of pairs of deleted input vertices within edges.
Assume, uniformly over deletion sets,
Then every cover has .
Indeed, an edge with deleted input roles and deleted output roles satisfies, whenever ,
Summing and using (7) gives , where
For , this functional is maximized at . To check the rearrangement, its first variation is
It decreases on . On it is at least , whereas on it is at most . The former is larger for . Moving mass from outside into its holes therefore increases the functional, at every intermediate density. Direct integration gives
Since on , would imply , a contradiction. Equivalently, apply this argument along any convergent subsequence of normalized deletion measures. The continuous kernels make the displayed functionals continuous under that passage.
This conditional deletion cost rules out improvement in (5) whenever , since then . At the first-order allowance , the sharper check is .
For Singer inputs, an unfinished approach to (7) represents the three-input relation as a symmetric trilinear form on a projective line, and seeks an auxiliary torus or additive-group law. Character sums could then control input-pair incidences. A separate uniform fixed-output bound is still required: except for boundedly many targets, ordered endpoint triple counts would need to be at most . The geometric irreducibility and character noncancellation needed for that assertion remain unproved. No unconditional Singer obstruction follows here.