Wiki
Wiki

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 B⊂(0,L]B\subset(0,L] be a finite set. Then A=B∪(−B)A=B\cup(-B) has unique unordered sums away from zero if and only if

B is Sidon,(B+B)∩(B−B)=∅.(1)B\text{ is Sidon},\qquad (B+B)\cap(B-B)=\varnothing. \tag{1}

Indeed the positive sums from AA are sums from B+BB+B and positive differences from B−BB-B. 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 AA.

The second condition in (1) is equivalent to

(B+B+B)∩B=∅.(2)(B+B+B)\cap B=\varnothing. \tag{2}

Thus the fully symmetric part of the target would follow from

∣B∣≤(2/3+o(1))L|B|\le(\sqrt{2/3}+o(1))\sqrt L

for Sidon, (3,1)(3,1)-sum-free sets B⊂[1,L]B\subset[1,L]. This statement has not been proved here. Taking a dense Sidon set in (L/3,L](L/3,L] attains the proposed constant.

If zero is also to be included in AA, one must additionally require (B+B)∩B=∅(B+B)\cap B=\varnothing. 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 T⊂GT\subset G symmetric Sidon with center zero if T=−TT=-T, and every nontrivial equality of two unordered pair sums has common sum zero. If G=ZnG=\mathbb Z_n and TT has no nonzero element of order two, choose its centered representatives in (−n/2,n/2)(-n/2,n/2). Modular nonexceptional sum uniqueness implies integer nonexceptional sum uniqueness. An exceptional sum is a multiple of nn, but the integer pair sums lie in (−n,n)(-n,n), so it can only be zero. The representatives can be translated into [n][n].

In particular a cyclic symmetric Sidon family with ∣T∣>(2/3+ε)n|T|>(2/\sqrt3+\varepsilon)\sqrt n would disprove the interval conjecture. No such family was found.

The modulus-three construction

Let D⊂ZvD\subset\mathbb Z_v be modular Sidon, with gcd⁡(v,3)=1\gcd(v,3)=1. In Z3×Zv\mathbb Z_3\times\mathbb Z_v, put

T=({1}×D)∪({−1}×(−D)).T=(\{1\}\times D)\cup(\{-1\}\times(-D)).

The two same-copy sum types and the mixed type have distinct first coordinates. Nonzero mixed sums are unique because nonzero differences in DD are unique. Thus TT is symmetric Sidon. Under CRT it gives an admissible integer set of size 2∣D∣2|D| in [3v][3v]. Ordinary modular Sidon sets of size (1+o(1))v(1+o(1))\sqrt v reproduce the constant 2/32/\sqrt3.

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 v=q2+q+1v=q^2+q+1, ∣D∣=q+1|D|=q+1, and q=22r+1q=2^{2r+1}, so gcd⁡(v,3)=1\gcd(v,3)=1. The difference-set identity gives ∣1D^(χ)∣=q|\widehat{1_D}(\chi)|=\sqrt q at every nonprincipal character. For every fixed nonzero integer Fourier frequency on Z3v\mathbb Z_{3v}, the Zv\mathbb Z_v component is nonprincipal for all sufficiently large vv. The normalized Fourier coefficient of TT is therefore O(q−1/2)O(q^{-1/2}). Weyl's criterion gives uniform macroscopic distribution of the representatives in [0,3v][0,3v]. For the standard Singer construction, see §3.4 and entry [4] of source record. Its Sidon property and (q+1)q=v−1(q+1)q=v-1 show that every nonzero difference occurs exactly once, which proves the character identity used above. No upper bound in these notes uses this construction.

A subset BB of an abelian group is four-independent if ∑b∈Bλbb=0\sum_{b\in B}\lambda_b b=0 and ∑b∣λb∣≤4\sum_b|\lambda_b|\le4 imply that all integer λb\lambda_b vanish. For BB disjoint from −B-B, the following characterization holds:

B is four-independent⟺{0}∪B∪(−B) is symmetric Sidon with center zero.(3)B\text{ is four-independent}\quad\Longleftrightarrow\quad \{0\}\cup B\cup(-B)\text{ is symmetric Sidon with center zero}. \tag{3}

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 ±B\pm B 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

(1/8−o(1))n≤s(Zn,4)≤(1/2+o(1))n(1/\sqrt8-o(1))\sqrt n\le s(\mathbb Z_n,4) \le(1/\sqrt2+o(1))\sqrt n

and conjecture s(Zn,4)∼n/3s(\mathbb Z_n,4)\sim\sqrt{n/3}. See the full primary paper, pp. 15–16. This is a related conjecture, not a theorem proving the target.

The map Z∣B∣→Zn\mathbb Z^{|B|}\to\mathbb Z_n taking the standard basis to the elements of BB is injective on the Lee ball of radius two exactly when BB is four-independent. That ball has 2∣B∣2+2∣B∣+12|B|^2+2|B|+1 elements. Thus a cyclic lattice packing density asymptotically greater than 2/32/3 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 nn, is the packing denominator.

Xiao–Zhou, On the packing density of Lee spheres (2024), advertise radius-two lattice packings with density tending to 2/32/3, 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 x+y=zx+y=z 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 D⊂[0,v]∩ZD\subset[0,v]\cap\mathbb Z be ordinary Sidon and let 0<w<v0<w<v be an integer. Set

t=(v−w)/2,B=t+(D∖R).t=(v-w)/2,\qquad B=t+(D\setminus R).

Then BB is Sidon, and B∩3B=∅B\cap3B=\varnothing is equivalent to requiring that RR meet the support of every relation

d1+d2+d3=d4−v+w,di∈D.(4)d_1+d_2+d_3=d_4-v+w,\qquad d_i\in D. \tag{4}

Repeated inputs are permitted. Every input in such a relation belongs to D∩[0,w]D\cap[0,w], and the output belongs to D∩[v−w,v]D\cap[v-w,v]. This follows immediately from nonnegativity and d4≤vd_4\le v.

The symmetric set ±B\pm B lies in an interval of span 3v−w3v-w. Since tt is an integer or half-integer, a translation puts it in an integer interval of length 3v−w+13v-w+1. If ∣D∣∼v|D|\sim\sqrt v and w=εv+O(1)w=\varepsilon v+O(1), this construction would beat the target provided, for a fixed positive margin,

∣R∣<(1−1−ε/3)v.(5)|R|< \left(1-\sqrt{1-\varepsilon/3}\right)\sqrt v. \tag{5}

For small fixed ε\varepsilon, the required proportion is ε/6+O(ε2)\varepsilon/6+O(\varepsilon^2).

Deleting all of D∩[0,w/3]D\cap[0,w/3] is a valid cover: the remaining three inputs have sum greater than ww. For an asymptotically maximal Sidon set in [0,v][0,v], uniform distribution makes this cost (ε/3+o(1))v(\varepsilon/3+o(1))\sqrt v, 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 w≍v3/4w\asymp v^{3/4}. Averaging over ww permits deletion of only O(v1/4)O(v^{1/4}) outputs and proves a positive N1/4N^{1/4} gain over the reflected lower bound along an unbounded sequence. It does not handle fixed positive w/vw/v.

There is also a limitation on replacing the geometric cover by another macroscopic region. In normalized endpoint coordinates, let measurable U,V⊂[0,1]U,V\subset[0,1] be the deleted input and output regions. Suppose they cover every relation

x1+x2+x3+y=1,xi,y∈[0,1].x_1+x_2+x_3+y=1,\qquad x_i,y\in[0,1].

The diagonal relations 3x+y=13x+y=1 show that

∣U∩[0,1/3]∣+13∣V∣≥13,hence∣U∣+∣V∣≥13.(6)|U\cap[0,1/3]|+\frac13|V|\ge\frac13, \qquad\text{hence}\qquad |U|+|V|\ge\frac13. \tag{6}

The same conclusion holds if coverage is required only almost everywhere on the three-dimensional relation hypersurface. Otherwise there is a density point xx of the surviving inputs for which 1−3x1-3x is a density point of the surviving outputs. Three small near-full neighborhoods of xx, together with a near-full neighborhood of 1−3x1-3x, 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 εv/3\varepsilon\sqrt v/3 when w=εvw=\varepsilon v. 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 v∼q2v\sim q^2, w/v→ε∈(0,1/2)w/v\to\varepsilon\in(0,1/2), and the endpoint empirical measures of DD are uniform. Form the hypergraph of relations (4) with three distinct input vertices. For a cover RR, write u(x),z(y)∈[0,1]u(x),z(y)\in[0,1] for limiting deleted densities in coordinates x=d/wx=d/w at the lower endpoint and y=(v−d)/wy=(v-d)/w at the upper endpoint. Put a=∫ua=\int u, b=∫zb=\int z. Let EE be the edge count, IL,IUI_L,I_U the deleted lower- and upper-vertex incidences, and JLLJ_{LL} the count of pairs of deleted input vertices within edges.

Assume, uniformly over deletion sets,

E=(ε3/36+o(1))q2,IL/E=9∫u(x)(1−x)2 dx+o(1),E=(\varepsilon^3/36+o(1))q^2,\qquad I_L/E=9\int u(x)(1-x)^2\,dx+o(1), JLL/E=18∬u(x)u(y)(1−x−y)+ dx dy+o(1),IU/E≤3b+o(1).(7)J_{LL}/E=18\iint u(x)u(y)(1-x-y)_+\,dx\,dy+o(1), \qquad I_U/E\le3b+o(1). \tag{7}

Then every cover has ∣R∣≥(0.17−o(1))εq|R|\ge(0.17-o(1))\varepsilon q.

Indeed, an edge with k≤3k\le3 deleted input roles and l≤1l\le1 deleted output roles satisfies, whenever k+l≥1k+l\ge1,

1≤k+l−23(k2).1\le k+l-\tfrac23\binom{k}{2}.

Summing and using (7) gives 1≤F(u)+3b+o(1)1\le\mathcal F(u)+3b+o(1), where

F(u)=9∫u(x)(1−x)2 dx−12∬u(x)u(y)(1−x−y)+ dx dy.\mathcal F(u)=9\int u(x)(1-x)^2\,dx -12\iint u(x)u(y)(1-x-y)_+\,dx\,dy.

For a≤0.17a\le0.17, this functional is maximized at u=1[0,a]u=1_{[0,a]}. To check the rearrangement, its first variation is

gu(x)=9(1−x)2−24∫u(y)(1−x−y)+ dy,gu′(x)≤−18(1−x)+24a.g_u(x)=9(1-x)^2-24\int u(y)(1-x-y)_+\,dy, \qquad g_u'(x)\le-18(1-x)+24a.

It decreases on [0,1−4a/3][0,1-4a/3]. On [0,a][0,a] it is at least 9(1−a)2−24a9(1-a)^2-24a, whereas on [1−4a/3,1][1-4a/3,1] it is at most 16a216a^2. The former is larger for a≤0.17a\le0.17. Moving mass from outside [0,a][0,a] into its holes therefore increases the functional, at every intermediate density. Direct integration gives

F(u)≤F(a)=9a−21a2+15a3.\mathcal F(u)\le F(a)=9a-21a^2+15a^3.

Since F′(a)>3F'(a)>3 on [0,0.17][0,0.17], a+b≤0.17a+b\le0.17 would imply F(u)+3b≤F(0.17)=0.996795<1\mathcal F(u)+3b\le F(0.17)=0.996795<1, 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 0<ε<200/8670<\varepsilon<200/867, since then 0.17ε>1−1−ε/30.17\varepsilon>1-\sqrt{1-\varepsilon/3}. At the first-order allowance a+b=1/6a+b=1/6, the sharper check is F(1/6)=71/72<1F(1/6)=71/72<1.

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 (ε2/2+o(1))q(\varepsilon^2/2+o(1))q. The geometric irreducibility and character noncancellation needed for that assertion remain unproved. No unconditional Singer obstruction follows here.