An upper bound on the size of Sidon sets

2021/03/29 by Balogh, József, Füredi, Zoltán, Roy, Souktik · 1 citation
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.2103.15850

Abstract

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.

Cited by

• An arithmetic measure of width for convex bodies

Related

• One conjecture about size of Sidon sets
• Sidon sets in a union of intervals
• On the number of generalized Sidon sets
• A numerical note on upper bounds for b 2 [g] sets
• On Sidon sets in a random set of vectors