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 , let and take a perfect difference set modulo . Arbitrary lifts
remain Sidon if there is only one point above each residue. With independent uniform , , each residue outside has at least vertex-disjoint triple witnesses. For a fixed integer , each witness has probability at least of becoming an exact integer representation . Hence its failure probability is at most
The union bound over targets succeeds when .
After all targets outside the residue classes are blocked, any added point shares a residue with an old point. Their differences are distinct multiples of in , so only additions are possible. This proves Ruzsa's bound.
At , 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 -size maximal completion.