An upper bound on the size of Sidon sets [article]

József Balogh, Zoltán Füredi, Souktik Roy
2021 arXiv   pre-print
In this entry point into the subject, combining two elementary proofs, we decrease the gap between the upper and lower bounds by 0.2% in a classical combinatorial number theory problem. We show that the maximum size of a Sidon set of { 1, 2, ..., n} is at most √(n)+ 0.998n^1/4 for sufficiently large n.
arXiv:2103.15850v2 fatcat:pnfncdgwejarldzcrspmz7uuv4