Research log for issue #61. The conjecture asks if there is a Sidon set with
In a Sidon set, equality of two pair sums forces the pairs to agree as multisets, allowing repeated summands.
Literature
- Erdős's 1980 survey attributes the conjecture to Erdős and Krückeberg. The finite Erdős–Turán bound gives the universal upper limit . Krückeberg attains .
- Alexeev and Mixon, Conjecture 4 state the infinite problem separately from the finite perfect-difference-set extension conjecture. They disprove that finite extension conjecture and identify Hall's earlier counterexample.
- O'Bryant and the November 2026 preprint of Wang and Yang distinguish the upper limit from lower-limit bounds and constructions with bounded multiplicities or higher-order sums. The Wang–Yang construction treats sets for .
- Erdős Problem 329 and the Erdős Problems wiki record the exact infinite conjecture. The source search through November 2026 found no proof or disproof of it.
- Eberhard and Manners identify the common finite-projective-plane structure of many dense modular Sidon sets. The Erdős Problem a Day report on #44 records explicit finite seeds that fail to embed in certain classical constructions and a deletion bound for Singer sets.
An obstruction to preserving prefixes in the classical constructions
Theorem. Let . Suppose that there are cutoffs and cyclic Sidon sets with . Suppose membership in is the vanishing of a linear recurrence of order at most , over a field , with the same bound for all . More precisely, for all , the recurrence term at vanishes exactly when . Assume that all but at most elements of lie in upon reduction modulo , for a fixed .
Then . If the fields can be taken of characteristics tending to infinity, or of characteristic zero, then is finite.
To prove this, pad the recurrences to order if necessary. In the polynomial ring , define the universal recurrence terms by
Each individual sequence is an evaluation of these polynomials into . The ring is countable. By successive subsequences and diagonal selection, arrange that each polynomial either vanishes eventually in the evaluations or is eventually nonzero. The eventually vanishing polynomials form a prime ideal . Indeed never vanishes, and if neither factor vanishes eventually then their product is eventually nonzero in the fields. Take the universal recurrence in the fraction field of , and let be its set of zero indices.
At most elements of can lie outside . Otherwise fixed such elements would be excluded together for all large . The zero set is itself Sidon over the integers. Any nontrivial equality of two pair sums in would occur in the finite models eventually. For large , all the distinct indices appearing in the equality remain distinct modulo , contradicting that is Sidon. In particular, contains no infinite arithmetic progression.
In characteristic zero, the Skolem–Mahler–Lech theorem now makes finite. In characteristic , Derksen's Corollary 1.11 gives . If the input characteristics tend to infinity, each nonzero integer polynomial of degree zero is eventually nonzero, so has characteristic zero. This also holds if all input fields have characteristic zero.
Three families of order at most three
In each formula below an affine change of the exponents , with invertible modulo the cyclic group order, is allowed.
- In the Singer construction the set is given by , where the class of generates . Multiplication by acts linearly on a three-dimensional space. Applying the trace functional to its orbit gives the recurrence by Cayley–Hamilton.
- In the Bose–Chowla construction a power of a primitive element of belongs to an affine line. This is a condition for a linear functional and a primitive . The homogeneous term has order at most two and the constant increases the order by at most one.
- In the Ruzsa construction in , the membership condition after an affine change is over , with . The exponential satisfies a first-order recurrence and the affine polynomial has second forward difference zero. In this family unbounded moduli force .
Thus any fixed infinite set whose successive prefixes are contained in a mixture of these three families, up to a fixed number of omissions, grows at most logarithmically. The conclusion also applies to incidence along a cyclic projective linear orbit in dimension three whenever the modular incidence set is Sidon: a linear equation of the projective line gives the same recurrence after choosing a matrix representative of the generator.
The logarithmic scale is attained
Let . This is Sidon because the positive difference for determines by its 2-adic valuation and then determines . For every sufficiently large of characteristic , a Singer difference set contains a generator of its cyclic group of order . To see this, every nontrivial character sum over the difference set has magnitude , by the equation for its difference multiplicities. Detecting multiples of divisors of by characters, and then applying Möbius inversion, counts
generators in the set. This is positive for large . Take a representative of such a generator with trace zero. Then each has trace zero by Frobenius. Using as the projective generator puts every fixed prefix of into Singer sets of arbitrarily large modulus.
The prefix theorem concerns exact modular embeddings with a uniform bound on the number of omitted points. A general integer Sidon set can have collisions after reduction modulo a number close to the length of its containing interval. That is an additional gap between this obstruction and the full infinite conjecture.
A deletion bound for all three cyclic constructions
Theorem. Let be the standard integer representatives of any affine Singer, Bose–Chowla or Ruzsa Sidon set. Let be an integer Sidon set that contains some . Then
uniformly in and . The earlier deletion bound for Singer sets gives the constant in that family. Here the count comes from equidistribution of the two summands in a representation of as a sum minus a third element.
First count modular solutions in . We will show that at least of the ordered solutions satisfy the same equality over the integers. Since , fixing a value as the first summand determines at most one ordered difference in the modular Sidon set. The same holds for the second summand. Fixing determines at most two ordered pairs . Thus removing any one element destroys at most four ordered solutions. Every genuine integer solution must lose at least one of its three elements if we adjoin . The claimed lower bound follows.
Character sums for Singer sets
Write , , and let be the trace-zero subspace of . Under the affine identification the indices of correspond to the classes of in . Let be a representative of the class for . It is outside , and a modular solution corresponds to classes with in the quotient. Equivalently, satisfy , with determined.
The bilinear form is nondegenerate on . Its radical would consist of the vectors in for which is in the trace annihilator of , namely . As , the radical is zero. Consequently each projective determines by an invertible projective linear map of . Choose representatives for the finite parameters of the projective line in the form
where each pair of coefficients is linearly independent over . The parameter at infinity affects the counts by at most one.
Let generate the characters of in the chosen exponent coordinate. For any fixed integer frequencies , the Fourier coefficient for the ordered summands is, up to a constant of modulus one, the sum of over . Here and below the affine changes of the indices only change the generator of the character group and the constant factor. Put and . Both have degree three over .
If their minimal polynomials are distinct, the character sum is a sum over monic degree-one polynomials for a Dirichlet character of modulo the product of those two cubics. This follows by identifying the quotient at each cubic with by evaluation at its root. For a nonzero fixed frequency pair and sufficiently large , at least one local character is nontrivial. Weil's bound gives for this sum. In the function-field Dirichlet formulation, the sum is the coefficient of degree one in the -polynomial, and the degree of the modulus is bounded. A trivial local character can be removed from the modulus since none of the tested linear polynomials vanishes there.
If for or , the two characters combine into a character at the same cubic with exponent modulo . This is nonzero modulo for a fixed nonzero pair and sufficiently large . For use . The same square-root bound applies. In the remaining case , the two field representatives are proportional by a fixed scalar. This scalar preserves , so it lies in by the trace annihilator property. The modular solutions then have . Their single coordinate is equidistributed, since the nontrivial character sums of a Singer difference set have magnitude .
Character sums for Bose–Chowla sets
Now take , and identify with for . Write for the linear functional with and . Let be the nonzero field element corresponding to . With , the equations for become
For all but at most one , the coefficient of is nonzero, giving as a linear fractional function of . When the coefficient vanishes, lies in , so the equation would force , which is excluded. The same argument with exchanged proves that the fractional function is nonconstant for large . In particular it has the form with in . Therefore
The numerator coefficients are independent over . The numerator and give irreducible quadratics in the function-field Dirichlet character argument, and a nonconstant denominator gives a linear factor. The multiplicative character now has order on and order on .
If the two quadratic factors are distinct, a nonzero frequency gives a nontrivial character at at least one factor. If the roots are distinct conjugates, the exponent at their common quadratic is , which gives a nontrivial character for any fixed nonzero pair and large . If the roots are equal and is nonconstant, the denominator factor is nontrivial when for large . When the first frequency gives a nontrivial character. All three cases give a square-root bound. Removing the possible pole changes the bound by .
Finally, if the quadratic roots are equal and the denominator constant, then is a fixed scalar multiple of . Preservation of the affine line forces the scalar to be in by taking differences and then to be by applying . These are diagonal solutions. The single summand coordinate is equidistributed by the same character bound for one irreducible quadratic.
Character sums for Ruzsa sets
Use the cyclic group model , with addition in the first coordinate and multiplication in the second. The set is the diagonal with . If the image of is , then and . The modular equation determines the second summand by
There are only excluded values where a denominator or one of the required nonzero coordinates vanishes. A generating character in the exponent coordinate splits into a nontrivial additive character and a generating multiplicative character . The sum for each fixed nonzero frequency pair , apart from a constant of modulus one, is
For sufficiently large , the additive argument has a simple pole at if , and a simple pole at infinity if and . This excludes the Artin–Schreier exceptional form, since the poles of have orders divisible by . Thus the mixed Weil character bound gives .
From modular to integer solutions
In the cases with the two-dimensional character bounds, the pairs are equidistributed in the unit square by the Fourier criterion. The number of modular solutions is by the parameterizations. A modular solution becomes an integer solution precisely when . For the strip has area . In the diagonal cases, the corresponding interval for has length . These estimates are uniform in the choice of . Indeed any subsequence of choices has a further subsequence with convergent, where the strip or interval boundaries have limiting measure zero. In every case at least ordered solutions are integer solutions, as claimed.
Consequence for an infinite Sidon set
For every infinite integer Sidon set , the fraction of agreement with these classical sets satisfies
where the supremum is over these affine constructions at the available moduli. Indeed, agreement above along an unbounded sequence of moduli would force every element of to be in for all sufficiently large members of the sequence. The recurrence theorem would then bound these prefixes by , contradicting the supposed agreement. This rules out obtaining the conjectured infinite density by modifications of size of these three classical cyclic families. The infinite conjecture is open.
Translated blocks and the constant
Let be an infinite Sidon set, and suppose it retains a fraction tending to one of each of a sequence of blocks , where , is one of the three classical sets above, and . Then
Suppose instead that along a subsequence for some fixed . For any fixed set . If , we can apply the modular triple argument with that residue. To obtain true integer collisions with in the translated block, take the strip . For , its area in the square is , and its length on the diagonal, in the summand coordinate, is . Since is fixed, and . These areas or lengths are bounded below by a positive constant depending on . At least that fraction, up to , of the modular triples turn into true collisions. The deletion bound contradicts retention of all but elements of the block.
Consequently each fixed is eventually present in the modular translate . By passing to a subsequence, there are cutoffs tending to infinity for which all points of the corresponding prefixes are present. The recurrence theorem gives . But the retained block gives points below on this subsequence, a contradiction.
In particular, if the prefixes up to differ from those translated blocks in points, their normalized sizes have upper limit at most . This is sharp within the sparse modification scheme. The usual lower-bound construction of Krückeberg can be implemented by translating each new block by , with the previous largest element. Remove at most elements of the new modular set to destroy all its positive differences at most . Each such difference occurs at most once. Internal new differences are then above the internal old differences, and mixed differences exceed . Two distinct mixed differences cannot agree because this would give an internal new difference at most . Taking very large compared with gives a prefix with points at . See also O'Bryant, Lemma 9 for the block construction.
The same argument gives a tradeoff with a fixed fraction of deletions. Along any sequence of blocks with , an infinite Sidon set must satisfy
If a subsequence had deletion fractions smaller by a fixed margin, the bounded-frequency calculation would force every fixed element of into the modular translates as before. The logarithmic growth bound again contradicts the retained block. Thus even if the number of deletions is unrestricted, prefixes built from a single such block with additional points have normalized upper limit at most . For this follows by maximizing , which decreases on that interval. For the whole block contributes at most after normalization.