Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Ruzsa's lifting construction


Ruzsa's lifting argument

Ruzsa's argument uses a perfect difference set supplied by Singer's theorem; see the Ruzsa digest, the full proof, and equations (9)--(11) of the Singer paper.

For a prime pp, let q=p2+p+1q=p^2+p+1 and take a perfect difference set B={b0,…,bp}B=\{b_0,\ldots,b_p\} modulo qq. Arbitrary lifts

ai=bi+qdia_i=b_i+q d_i

remain Sidon if there is only one point above each residue. With independent uniform di∈{0,…,M−1}d_i\in\{0,\ldots,M-1\}, M=⌊N/q⌋M=\lfloor N/q\rfloor, each residue outside BB has at least p/8p/8 vertex-disjoint triple witnesses. For a fixed integer m∈[1,N]m\in[1,N], each witness has probability at least c/Mc/M of becoming an exact integer representation m=au+av−awm=a_u+a_v-a_w. Hence its failure probability is at most

exp⁡(−c′p/M)≤exp⁡(−c′p3/N).\exp(-c'p/M)\le \exp(-c'p^3/N).

The union bound over NN targets succeeds when p3≫Nlog⁡Np^3\gg N\log N.

After all targets outside the residue classes BB are blocked, any added point shares a residue with an old point. Their differences are distinct multiples of qq in (−N,N)(-N,N), so only O(N/q)O(N/q) additions are possible. This proves Ruzsa's O((Nlog⁡N)1/3)O((N\log N)^{1/3}) bound.

At p≍N1/3p\asymp N^{1/3}, the displayed failure estimate is only a constant. Removing the logarithm is not justified by reusing the same union bound. Nor is there a proved theorem saying that the residual candidates admit an O(p)O(p)-size maximal completion.