Article ID Journal Published Year Pages File Type
4655890 Journal of Combinatorial Theory, Series A 2010 15 Pages PDF
Abstract

We study finite and infinite Sidon sets in Nd. The additive energy of two sets is used to obtain new upper bounds for the cardinalities of finite Sidon subsets of some sets as well as to provide short proofs of already known results. We also disprove a conjecture of Lindström on the largest cardinality of a Sidon set in [1,N]×[1,N] and relate it to a known conjecture of Vinogradov concerning the size of the smallest quadratic residue modulo a prime p.For infinite Sidon sets A⊂Nd, we prove that . Finally, we show how to map infinite Sidon sets in Nd to Nd′ in an effective way. As an application, we find an explicit Sidon set of positive integers A such that |A∩[1,n]|⩾n1/3+o(1).

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics