Wiki
Wiki

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 q≥13q\ge13, let

D={qi:0≤i<r},C={±3qi:0≤i<r},A=C∪D.D=\{q^i:0\le i<r\},\qquad C=\{\pm3q^i:0\le i<r\},\qquad A=C\cup D.

In an equality between two pair sums the coefficient at any power of qq lies in [−12,12][-12,12]. Reduction modulo qq, followed by division by qq, shows that all those coefficients vanish. At a single exponent, the unordered sums of coefficients in {−3,1,3}\{-3,1,3\} are −6,−2,0,2,4,6-6,-2,0,2,4,6, all distinct. A pair using distinct exponents also determines its two coefficients uniquely. Thus only zero has multiple representations.

But adjoining −qi-q^i creates

qi+qi=3qi+(−qi).q^i+q^i=3q^i+(-q^i).

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

E={−3,−1,2,6}.E=\{-3,-1,2,6\}.

Its ten unordered sums are −6,−4,−2,−1,1,3,4,5,8,12-6,-4,-2,-1,1,3,4,5,8,12, so it is Sidon, and E∩(−E)=∅E\cap(-E)=\varnothing. For arbitrary bits fx,ef_x,e, consider

T={(fx,x),(e+fx,−x):x∈E}⊂Z2×Z.T=\{(f_x,x),(e+f_x,-x):x\in E\} \subset\mathbb Z_2\times\mathbb Z.

The second-coordinate sum −4-4 has three distinct representations

(−3)+(−1)=2+(−6)=(−2)+(−2).(-3)+(-1)=2+(-6)=(-2)+(-2).

Their lifted sums occupy only (0,−4)(0,-4) and (1,−4)(1,-4). Two therefore coincide away from the designated exception (e,0)(e,0). 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: Z2×Z\mathbb Z_2\times\mathbb Z is not cyclic. A lift there is not automatically an integer construction with twice the original span.

Two-point continuum packing is insufficient

On [0,1][0,1], let the core profile cc equal a=12/5a=\sqrt{12/5} on the outer thirds and zero on the middle third. Let the unpaired profile uu equal a/2a/2 on the middle third and zero elsewhere. Put f=c+uf=c+u, and let f~(x)=f(−x)\widetilde f(x)=f(-x). Then

∫f=5/3>2/3.\int f=\sqrt{5/3}>2/\sqrt3.

Nevertheless

Q(t)=(f∗f~)(t)−12(c∗c~)(t)Q(t)=(f*\widetilde f)(t)-\tfrac12(c*\widetilde c)(t)

is even and piecewise linear, with

Q(0)=1,Q(1/3)=4/5,Q(2/3)=2/5,Q(1)=0.Q(0)=1,\quad Q(1/3)=4/5,\quad Q(2/3)=2/5,\quad Q(1)=0.

Hence Q(t)≤1Q(t)\le1 for all tt. These are precisely the coarse difference-capacity constraints from ρA−ρC/2≤1\rho_A-\rho_C/2\le1. The coarse sum constraint is also satisfied: since ff is symmetric about 1/21/2, max⁡(f∗f)=∫f2=9/5<2\max(f*f)=\int f^2=9/5<2.

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 BB of size bb, the fourth Fourier moment equals the additive energy 2b2−b2b^2-b. At the scale b≍Lb\asymp\sqrt L, both this diagonal energy and the natural scale for the forbidden count x+y+z=wx+y+z=w are LL. 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 HH, consider

T=(1,B)∪(2,C)∪(3,−C)∪(4,−B)⊂Z5×H.T=(1,B)\cup(2,C)\cup(3,-C)\cup(4,-B) \subset\mathbb Z_5\times H.

A direct classification by first-coordinate sum shows this is symmetric Sidon provided

B,C are Sidon,(B−B)∩(C−C)={0},(C+C+C)∩B=∅,(B+B+B)∩(−C)=∅.(1)\begin{gathered} B,C\text{ are Sidon},\qquad (B-B)\cap(C-C)=\{0\},\\ (C+C+C)\cap B=\varnothing,\qquad (B+B+B)\cap(-C)=\varnothing. \end{gathered} \tag{1}

For instance, in residue one the competing types are C−BC-B and −C−C-C-C; their collision is equivalent to 3C∩B≠∅3C\cap B\ne\varnothing. In residue two the competing types are B+BB+B and −C−B-C-B, 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 HH is cyclic, gcd⁡(5,∣H∣)=1\gcd(5,|H|)=1, and ∣B∣,∣C∣∼∣H∣/2|B|,|C|\sim\sqrt{|H|/2}, (1) would give the counterexample constant 8/5>2/3\sqrt{8/5}>2/\sqrt3. The cubic conditions are not established.

The difference packing itself is achievable. For odd prime qq, let h=(q−1)/2h=(q-1)/2, let QQ be the squares in Fq∗\mathbb F_q^*, let ω\omega generate QQ, and choose a nonsquare ν\nu. In the cyclic group H=Zh×FqH=\mathbb Z_h\times\mathbb F_q, take

B={(x,ωx):x∈Zh},C={(x,νωx):x∈Zh}.B=\{(x,\omega^x):x\in\mathbb Z_h\},\qquad C=\{(x,\nu\omega^x):x\in\mathbb Z_h\}.

At a nonzero first-coordinate difference ss, the possible second coordinates are respectively (ωs−1)Q(\omega^s-1)Q and ν(ωs−1)Q\nu(\omega^s-1)Q, 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 q≡3(mod4)q\equiv3\pmod4, q≥7q\ge7, the first cubic condition fails. It is equivalent to the absence of

ν(u+v+w)=uvw,u,v,w∈Q.\nu(u+v+w)=uvw,\qquad u,v,w\in Q.

Since ∣Q∣|Q| is odd, the map (u,v,w)↦(1/(vw),1/(uw),1/(uv))(u,v,w)\mapsto(1/(vw),1/(uw),1/(uv)) permutes Q3Q^3. The displayed equation is thus solvable if and only if 1/ν∈Q+Q+Q1/\nu\in Q+Q+Q. Cauchy–Davenport gives ∣Q+Q+Q∣≥min⁡(q,3∣Q∣−2)=q|Q+Q+Q|\ge\min(q,3|Q|-2)=q. So this natural full-fiber construction does not work.

A cyclic conic construction whose quotient fails

Let qq be odd, c∈Fq∗c\in\mathbb F_q^*, and c2≠1c^2\ne1. In Fq2∗\mathbb F_{q^2}^*, define

Sc={z:Tr⁡(z)=c(Norm⁡(z)+1)}.S_c=\{z:\operatorname{Tr}(z)=c(\operatorname{Norm}(z)+1)\}.

It is inversion invariant, has q+1q+1 elements, and is symmetric Sidon in the multiplicative group. Indeed z‾=(c−z)/(1−cz)\overline z=(c-z)/(1-cz), and if xy=t≠1xy=t\ne1, the two elements are roots of

c(1−t‾)X2+(t‾−t+c2(Norm⁡(t)−1))X+ct(1−t‾)=0.c(1-\overline t)X^2+ (\overline t-t+c^2(\operatorname{Norm}(t)-1))X +ct(1-\overline t)=0.

Its leading coefficient is nonzero, so the pair is unique. The size follows from Norm⁡(z−1/c)=1/c2−1≠0\operatorname{Norm}(z-1/c)=1/c^2-1\ne0. Also Sc∩(−Sc)=∅S_c\cap(-S_c)=\varnothing.

Quotienting by {±1}\{\pm1\} would almost double the squared density, but introduces nonexceptional collisions for every q≥17q\ge17. Here is a uniform proof. Put a=c2a=c^2 and

f(t)=a(t+1)2−4t.f(t)=a(t+1)^2-4t.

For t∈Fq∗∖{1}t\in\mathbb F_q^*\setminus\{1\}, a product representation xy=txy=t, with x,y∈Scx,y\in S_c, exists exactly when χ(f(t))∈{−1,0}\chi(f(t))\in\{-1,0\}, where χ\chi is the quadratic character. The two factors must be conjugates of norm tt and trace c(t+1)c(t+1); these are precisely the roots of X2−c(t+1)X+tX^2-c(t+1)X+t. Distinct roots in Fq\mathbb F_q do not qualify, while nonsquare discriminant or a double root does.

If a≠2a\ne2, the polynomial f(t)f(−t)f(t)f(-t) is squarefree of degree four. Each quadratic has nonzero discriminant 16(1−a)16(1-a), and common roots would imply t=0t=0, where f(0)=a≠0f(0)=a\ne0. Its leading coefficient is the square a2a^2, so the smooth genus-one completion of Y2=f(t)f(−t)Y^2=f(t)f(-t) has two rational points at infinity. The Hasse bound therefore gives

∑t∈Fqχ(f(t)f(−t))≥−1−2q.\sum_{t\in\mathbb F_q}\chi(f(t)f(-t))\ge-1-2\sqrt q.

Since ∑tχ(f(t))=∑tχ(f(−t))=−1\sum_t\chi(f(t))=\sum_t\chi(f(-t))=-1,

∑t(1−χ(f(t)))(1−χ(f(−t)))4≥q+1−2q4.\sum_t\frac{(1-\chi(f(t)))(1-\chi(f(-t)))}4 \ge\frac{q+1-2\sqrt q}{4}.

The at most four roots of the two quadratics contribute at most two. Thus for q≥17q\ge17 some tt has both characters equal to −1-1. Such a tt is not 0,1,−10,1,-1. If a=2a=2, then f(t)=f(−t)f(t)=f(-t), and the ordinary quadratic character sum likewise gives a nonsquare value at some t∉{0,1,−1}t\notin\{0,1,-1\}. Therefore both tt and −t-t are products from ScS_c, 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 pp be an odd prime, h=(p−1)/2h=(p-1)/2, QQ its nonzero quadratic residues, ω\omega a generator of QQ, and ν\nu a nonsquare. In H=Zh×FpH=\mathbb Z_h\times\mathbb F_p put

B={(x,ωx):x∈Zh},D={(x,νωx):x∈Zh}.B=\{(x,\omega^x):x\in\mathbb Z_h\},\qquad D=\{(x,\nu\omega^x):x\in\mathbb Z_h\}.

For arbitrary B′⊆BB'\subseteq B, D′⊆DD'\subseteq D, consider

A=({1}×B′)∪({2}×(−B′))∪({0}×D′)⊂Z3×H.A=(\{1\}\times B')\cup(\{2\}\times(-B')) \cup(\{0\}\times D')\subset\mathbb Z_3\times H.

If only the group sum zero can have multiple representations, then

3∣B′∣+4∣D′∣≤6h+O(h),∣A∣≤114h+O(h).(2)3|B'|+4|D'|\le6h+O(\sqrt h),\qquad |A|\le\frac{11}{4}h+O(\sqrt h). \tag{2}

Since 3∣H∣=3hp∼6h23|H|=3hp\sim6h^2, the latter constant is 11/(46)<2/311/(4\sqrt6)<2/\sqrt3. Thus even arbitrary thinning cannot turn this particular mixed template into a counterexample.

To prove (2), first note the necessary condition D′∩3B′=∅D'\cap3B'=\varnothing: d=b1+b2+b3d=b_1+b_2+b_3 would give

(0,d)+(2,−b3)=(1,b1)+(1,b2),(0,d)+(2,-b_3)=(1,b_1)+(1,b_2),

a nonexceptional collision. Parameterize a vertex of BB by a=ωx∈Qa=\omega^x\in Q, and a vertex of DD by its corresponding parameter t∈Qt\in Q. The full forbidden triples satisfy

a+b+c=νabc,t=abc.(3)a+b+c=\nu abc,\qquad t=abc. \tag{3}

Use only triples with three distinct BB-vertices as hyperedges, each also incident to its target DD-vertex.

For fixed a∈Qa\in Q, the number N(a)N(a) of ordered choices b,c∈Qb,c\in Q in (3) is obtained from

c=a+bνab−1.c=\frac{a+b}{\nu ab-1}.

Quadratic-character expansion gives N(a)=p/4+O(p)N(a)=p/4+O(\sqrt p) uniformly unless νa2=−1\nu a^2=-1. Indeed the nonconstant terms are a nondegenerate quadratic character sum and the sum for the cubic b(a+b)(νab−1)b(a+b)(\nu ab-1); the latter has three distinct roots and is bounded by 2p2\sqrt p by Hasse. Indicator corrections at zeros and poles are O(1)O(1). The exceptional equation νa2=−1\nu a^2=-1 can hold for at most one a∈Qa\in Q: it requires p≡3(mod4)p\equiv3\pmod4, and its two roots have opposite quadratic characters. In that case c=−a∉Qc=-a\notin Q, so N(a)=0N(a)=0.

Repeated-coordinate triples total O(p)O(p): when a=ba=b, the third coordinate is uniquely determined because νa2≠1\nu a^2\ne1. Consequently the hypergraph has

E=p2/48+O(p3/2)E=p^2/48+O(p^{3/2})

edges, and every BB-vertex has degree at most p/8+O(p)p/8+O(\sqrt p). For a fixed target tt, two distinct triples cannot share a vertex. A common aa determines bc=t/abc=t/a and b+c=νt−ab+c=\nu t-a, hence determines the remaining unordered pair. Thus each DD-vertex has degree at most h/3h/3.

Write b0=∣B′∣b_0=|B'|, d0=∣D′∣d_0=|D'|. The removed vertices must cover all edges, so

p248−O(p3/2)≤(h−b0)(p8+O(p))+(h−d0)h3.\frac{p^2}{48}-O(p^{3/2}) \le(h-b_0)\left(\frac p8+O(\sqrt p)\right) +(h-d_0)\frac h3.

Substituting p=2h+1p=2h+1 yields 3b0+4d0≤6h+O(h)3b_0+4d_0\le6h+O(\sqrt h). Finally

2b0+d0=54b0+14(3b0+4d0)≤114h+O(h).2b_0+d_0=\tfrac54b_0+\tfrac14(3b_0+4d_0) \le\tfrac{11}{4}h+O(\sqrt h).

Fiber-amplification obstruction

Let S=−S⊂K×HS=-S\subset K\times H be symmetric Sidon, and suppose its nonempty projection to KK consists of rr pairs {a,−a}\{a,-a\}, with 2a≠02a\ne0. For one representative of each pair, let Ca={x:(a,x)∈S}C_a=\{x:(a,x)\in S\} and ka=∣Ca∣k_a=|C_a|. Every CaC_a is Sidon, since a collision within that fiber has nonzero first coordinate 2a2a. Their nonzero difference sets are pairwise disjoint: an overlap gives two distinct representations of the same nonzero sum (0,d)(0,d) using opposite fibers. Therefore

∑aka(ka−1)≤∣H∣−1.\sum_a k_a(k_a-1)\le|H|-1.

Since ∑aka=∣S∣/2\sum_a k_a=|S|/2, Cauchy–Schwarz gives

∣S∣≤r+r2+4r(∣H∣−1).|S|\le r+\sqrt{r^2+4r(|H|-1)}.

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 A=±B⊂[−L,L]A=\pm B\subset[-L,L] lying in a translate of Z\mathbb Z, every orientation X={εbb:b∈B}X=\{\varepsilon_b b:b\in B\} satisfies

∣(X+X)∩I∣≤∣I∣/2+7∣I∣1/2(2L+1)1/4|(X+X)\cap I|\le |I|/2+7|I|^{1/2}(2L+1)^{1/4}

for an integer interval II, 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 LL, and divide its counting measure by L\sqrt L. Along any sequence with a limiting density gg on [0,1][0,1], the ordinary Sidon local-difference bound gives ∫01g2≤1\int_0^1g^2\le1. For an oriented limiting density ff,

f(x)+f(−x)=g(x),f(x),f(−x)≥0,∫−11f2≤∫01g2≤1.f(x)+f(-x)=g(x),\quad f(x),f(-x)\ge0, \qquad \int_{-1}^1f^2\le\int_0^1g^2\le1.

Cauchy--Schwarz then gives (f∗f)(s)≤1(f*f)(s)\le1 for every ss. These are exactly the limiting sum-interval inequalities, since unordered sums have limiting density (f∗f)/2(f*f)/2; diagonal pairs have vanishing normalized mass. In particular g≡1g\equiv1, which corresponds to ∣B∣2∼L|B|^2\sim L, 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 kk-point set into an ordinary Sidon set in length N+k2/4+o(N)N+k^2/4+o(N). 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 b≥2b\ge2, put

xi=3i−1−12,N=2⋅3b−1,A={(N+1)/2±xi:1≤i≤b}⊂[1,N].x_i=3^{i-1}-\tfrac12,\qquad N=2\cdot3^{b-1},\qquad A=\{(N+1)/2\pm x_i:1\le i\le b\}\subset[1,N].

Since xi+1>3xix_{i+1}>3x_i, domination by the largest uncanceled term rules out any nontrivial signed relation of length at most four among the xix_i. Therefore AA is admissible; its only repeated sum is N+1N+1.

Suppose a Sidon integer realization sends the elements corresponding to −xi,xi-x_i,x_i to ui,viu_i,v_i while preserving all strict pair-sum comparisons. Write qi=ui+viq_i=u_i+v_i and wi=vi−uiw_i=v_i-u_i. Preservation of the diagonal comparisons preserves the order of the elements, so wi>0w_i>0. Sidon uniqueness makes the qiq_i distinct. The original central sums lie strictly between the sums corresponding to −2x1-2x_1 and 2x12x_1. Consequently

2u1<qi<2v1,w1≥⌈b+12⌉.2u_1<q_i<2v_1, \qquad w_1\ge\left\lceil\frac{b+1}{2}\right\rceil.

The comparisons 2xi<xi+1−xi2x_i<x_{i+1}-x_i and their negative reflections give, using integrality,

vi+1≥3vi−qi+1,ui+1≤3ui−qi−1.v_{i+1}\ge3v_i-q_i+1, \qquad u_{i+1}\le3u_i-q_i-1.

Equivalently,

wi+1≥3wi+∣qi+1−qi∣+2≥3wi+3.w_{i+1}\ge3w_i+|q_{i+1}-q_i|+2\ge3w_i+3.

Thus the repaired diameter is at least

wb≥3b−1⌈b+12⌉+32(3b−1−1)=Ω(bN).w_b\ge 3^{b-1}\left\lceil\frac{b+1}{2}\right\rceil +\frac32(3^{b-1}-1)=\Omega(bN).

Here k=2bk=2b, so this is much larger than N+k2/4+o(N)N+k^2/4+o(N). Infinitesimal real perturbation followed by an integer realization preserving the strict sum order cannot supply the proposed repair. The example itself is sparse, with k=O(log⁡N)k=O(\log N). A square-root-dense extension now gives the same obstruction with k2/N→1/(1+δ)k^2/N\to1/(1+\delta), for fixed 0<δ<10<\delta<1. 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 [−L,L][-L,L] by its counting measure divided by L\sqrt L, and consider the limiting density f=1[−1,1]f=1_{[-1,1]}. Its mass corresponds to k∼2Lk\sim2\sqrt L, or coefficient 2\sqrt2 relative to an interval of length 2L2L.

For a normalized positive difference 0<t<20<t<2, the endpoint fiber is (x,x−t)(x,x-t), with t−1≤x≤1t-1\le x\le1. Reflection pairs its parameter xx with t−xt-x. For t/2<x≤1t/2<x\le1, write

Ot,x=δ(x,x−t)+δ(t−x,−x).\mathcal O_{t,x}= \delta_{(x,x-t)}+\delta_{(t-x,-x)}.

These are exactly the allowed two-edge reflected configurations. There is the identity of endpoint measures

∫t/21Ot,x dx=∫t−11δ(x,x−t) dx.(3)\int_{t/2}^{1}\mathcal O_{t,x}\,dx =\int_{t-1}^{1}\delta_{(x,x-t)}\,dx. \tag{3}

The integration interval on the left has length q(t)=1−t/2≤1q(t)=1-t/2\le1. Thus the right side is a convex mixture of allowed configurations: use the empty configuration with probability 1−q(t)1-q(t), and otherwise choose a reflection orbit uniformly. The fixed orbit x=t/2x=t/2, 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 f(x)f(y) dx dyf(x)f(y)\,dx\,dy. Inserting any bounded fixed endpoint test, including a matrix weight v(x)v(y)∗v(x)v(y)^*, 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 ff 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.