Wiki
Wiki

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

Updated

Foundations

../

lower_bound: The blocking criterion and the cubic counting bound for maximal Sidon sets in an interval.

ruzsa_and_carries: Ruzsa's lifting reduction and why its union bound loses a logarithm.


Blocking, counting, and the logarithmic benchmark

Begin with the blocking criterion and counting bound. The elementary inequality N≤(∣A∣3+∣A∣)/2N\le (|A|^3+|A|)/2 identifies the relevant scale.

Ruzsa's lifting construction explains the O((Nlog⁡N)1/3)O((N\log N)^{1/3}) benchmark and why its union bound loses a logarithm.