Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Obstructions
These are limitations of specific arguments, not evidence that the Erdős bound is false. The target remains unresolved.
Reflection completion is not valid in general
For an integer , let
In an equality between two pair sums the coefficient at any power of lies in . Reduction modulo , followed by division by , shows that all those coefficients vanish. At a single exponent, the unordered sums of coefficients in are , all distinct. A pair using distinct exponents also determines its two coefficients uniquely. Thus only zero has multiple representations.
But adjoining creates
No unpaired element can be reflected while retaining the existing core. These examples have exponentially large diameter; they do not exclude a dense asymptotic symmetrization theorem.
A binary phase does not always repair symmetric completion
Even an ordinary Sidon input need not admit a signed binary lift. Take
Its ten unordered sums are , so it is Sidon, and . For arbitrary bits , consider
The second-coordinate sum has three distinct representations
Their lifted sums occupy only and . Two therefore coincide away from the designated exception . This proves that universal binary-phase symmetrization is false. It does not exclude an asymptotic version permitting a negligible deletion.
A separate span issue remains in any such proposal: is not cyclic. A lift there is not automatically an integer construction with twice the original span.
Two-point continuum packing is insufficient
On , let the core profile equal on the outer thirds and zero on the middle third. Let the unpaired profile equal on the middle third and zero elsewhere. Put , and let . Then
Nevertheless
is even and piecewise linear, with
Hence for all . These are precisely the coarse difference-capacity constraints from . The coarse sum constraint is also satisfied: since is symmetric about , .
This profile is not an integer construction. It proves that these two-point continuum constraints, even at all shifts, cannot alone give the conjectured constant.
Fourier uniformity does not supply a four-variable counting lemma
For a Sidon set of size , the fourth Fourier moment equals the additive energy . At the scale , both this diagonal energy and the natural scale for the forbidden count are . Controlling only the large Fourier coefficients does not make the remaining fourth-order contribution negligible.
Ortega–Prendiville's Extremal Sidon sets are Fourier uniform, with applications to partition regularity does prove Fourier uniformity near the ordinary Sidon maximum, but its partition-regularity application requires at least five variables. See the hypotheses in the primary paper. It does not provide the missing four-variable result.
A four-fiber template and its remaining cubic conditions
For an abelian group , consider
A direct classification by first-coordinate sum shows this is symmetric Sidon provided
For instance, in residue one the competing types are and ; their collision is equivalent to . In residue two the competing types are and , giving the other cubic condition. Residues three and four follow by symmetry. Residue zero consists of the within-fiber differences, whose only common value must be zero. The disjoint-difference condition also makes every cross-fiber sum or difference injective.
If is cyclic, , and , (1) would give the counterexample constant . The cubic conditions are not established.
The difference packing itself is achievable. For odd prime , let , let be the squares in , let generate , and choose a nonsquare . In the cyclic group , take
At a nonzero first-coordinate difference , the possible second coordinates are respectively and , disjoint, and each occurs once. The first-coordinate zero difference is only zero. Hence both fibers are Sidon and their nonzero differences are disjoint.
However, for primes , , the first cubic condition fails. It is equivalent to the absence of
Since is odd, the map permutes . The displayed equation is thus solvable if and only if . Cauchy–Davenport gives . So this natural full-fiber construction does not work.
A cyclic conic construction whose quotient fails
Let be odd, , and . In , define
It is inversion invariant, has elements, and is symmetric Sidon in the multiplicative group. Indeed , and if , the two elements are roots of
Its leading coefficient is nonzero, so the pair is unique. The size follows from . Also .
Quotienting by would almost double the squared density, but introduces nonexceptional collisions for every . Here is a uniform proof. Put and
For , a product representation , with , exists exactly when , where is the quadratic character. The two factors must be conjugates of norm and trace ; these are precisely the roots of . Distinct roots in do not qualify, while nonsquare discriminant or a double root does.
If , the polynomial is squarefree of degree four. Each quadratic has nonzero discriminant , and common roots would imply , where . Its leading coefficient is the square , so the smooth genus-one completion of has two rational points at infinity. The Hasse bound therefore gives
Since ,
The at most four roots of the two quadratics contribute at most two. Thus for some has both characters equal to . Such a is not . If , then , and the ordinary quadratic character sum likewise gives a nonsquare value at some . Therefore both and are products from , giving different representations of a nonexceptional product in the quotient. This rules out this particular density-improvement mechanism, not other cyclic symmetric Sidon constructions.
The stronger arbitrary-thinning obstruction now shows that even replacing the full conic by an arbitrary subset cannot make this sign-quotient scheme improve the target constant.
A mixed three-fiber construction fails even after arbitrary thinning
This obstruction does not establish an upper bound for general admissible sets.
Let be an odd prime, , its nonzero quadratic residues, a generator of , and a nonsquare. In put
For arbitrary , , consider
If only the group sum zero can have multiple representations, then
Since , the latter constant is . Thus even arbitrary thinning cannot turn this particular mixed template into a counterexample.
To prove (2), first note the necessary condition : would give
a nonexceptional collision. Parameterize a vertex of by , and a vertex of by its corresponding parameter . The full forbidden triples satisfy
Use only triples with three distinct -vertices as hyperedges, each also incident to its target -vertex.
For fixed , the number of ordered choices in (3) is obtained from
Quadratic-character expansion gives uniformly unless . Indeed the nonconstant terms are a nondegenerate quadratic character sum and the sum for the cubic ; the latter has three distinct roots and is bounded by by Hasse. Indicator corrections at zeros and poles are . The exceptional equation can hold for at most one : it requires , and its two roots have opposite quadratic characters. In that case , so .
Repeated-coordinate triples total : when , the third coordinate is uniquely determined because . Consequently the hypergraph has
edges, and every -vertex has degree at most . For a fixed target , two distinct triples cannot share a vertex. A common determines and , hence determines the remaining unordered pair. Thus each -vertex has degree at most .
Write , . The removed vertices must cover all edges, so
Substituting yields . Finally
Fiber-amplification obstruction
Let be symmetric Sidon, and suppose its nonempty projection to consists of pairs , with . For one representative of each pair, let and . Every is Sidon, since a collision within that fiber has nonzero first coordinate . Their nonzero difference sets are pairwise disjoint: an overlap gives two distinct representations of the same nonzero sum using opposite fibers. Therefore
Since , Cauchy–Schwarz gives
This explains why a small symmetric Sidon pattern with a good finite ratio cannot simply be amplified by independent large Sidon fibers while preserving that ratio.
Optimizing ordinary-Sidon transversals at macroscopic scales
Every set obtained by retaining one element of each reflected core pair and all the unpaired elements is ordinary Sidon. The possible central element may also be retained. Thus, for a symmetric set lying in a translate of , every orientation satisfies
for an integer interval , after an appropriate translation. This is Theorem 1, equation (3.2), in source record. It includes diagonal pairs.
Optimizing this inequality over orientations does not strengthen the existing macroscopic energy bound. To see this, normalize the positive half by , and divide its counting measure by . Along any sequence with a limiting density on , the ordinary Sidon local-difference bound gives . For an oriented limiting density ,
Cauchy--Schwarz then gives for every . These are exactly the limiting sum-interval inequalities, since unordered sums have limiting density ; diagonal pairs have vanishing normalized mass. In particular , which corresponds to , passes every such macroscopic orientation test. This conclusion does not dispose of a microscopic orientation argument, but none was established.
Strict sum-order preservation makes exception repair too expensive
A possible upper-bound strategy would repair an admissible -point set into an ordinary Sidon set in length . Such a repair would give the target by the ordinary Sidon upper bound. Unrestricted relocation merely reformulates the target asymptotically; a construction using the input is required. The following example rules out a universal repair that preserves every original strict comparison between pair sums.
For , put
Since , domination by the largest uncanceled term rules out any nontrivial signed relation of length at most four among the . Therefore is admissible; its only repeated sum is .
Suppose a Sidon integer realization sends the elements corresponding to to while preserving all strict pair-sum comparisons. Write and . Preservation of the diagonal comparisons preserves the order of the elements, so . Sidon uniqueness makes the distinct. The original central sums lie strictly between the sums corresponding to and . Consequently
The comparisons and their negative reflections give, using integrality,
Equivalently,
Thus the repaired diameter is at least
Here , so this is much larger than . Infinitesimal real perturbation followed by an integer realization preserving the strict sum order cannot supply the proposed repair. The example itself is sparse, with . A square-root-dense extension now gives the same obstruction with , for fixed . This still does not reach the supercritical regime, and no unrestricted repair allowing substantial reordering was found.
Reflection patterns still admit the uniform pair model
Even allowing fixed macroscopic vector weights, rather than scalar ones, does not remove the following two-point relaxation. Normalize a hypothetical symmetric set in by its counting measure divided by , and consider the limiting density . Its mass corresponds to , or coefficient relative to an interval of length .
For a normalized positive difference , the endpoint fiber is , with . Reflection pairs its parameter with . For , write
These are exactly the allowed two-edge reflected configurations. There is the identity of endpoint measures
The integration interval on the left has length . Thus the right side is a convex mixture of allowed configurations: use the empty configuration with probability , and otherwise choose a reflection orbit uniformly. The fixed orbit , which would be a singleton configuration, has measure zero and does not affect this leading-order statement.
The right side of (3) is the difference-fiber disintegration of . Inserting any bounded fixed endpoint test, including a matrix weight , preserves the identity. Consequently every linear test that uses the allowable reflected configuration separately at each difference is compatible with this uniform profile. The usual continuum convolution positivity and Cauchy--Schwarz constraints also hold, since is an actual nonnegative density.
This is stronger than merely imposing multiplicity at most two: the reflection partner locations have been retained exactly. It does not assert that independently chosen difference configurations can come from one integer set. Microscopic or growing-dimensional weights, and consistency constraints involving several differences, remain outside this obstruction.