Abstract
We study finite and infinite Sidon sets in N d . 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 ⊂ N d , we prove that lim inf n → ∞ | A ∩ [ 1 , n ] d | n d / log n > 0 . Finally, we show how to map infinite Sidon sets in N d to N d ′ in an effective way. As an application, we find an explicit Sidon set of positive integers A such that | A ∩ [ 1 , n ] | ⩾ n 1 / 3 + o ( 1 ) .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
