On the ubiquity of Sidon sets
Melvyn B. Nathanson
Abstract
A Sidon set is a set A of integers such that no integer has two essentially distinct representations as the sum of two elements of A. More generally, for every positive integer g, a B2[g]-set is a set A of integers such that no integer has more than g essentially distinct representations as the sum of two elements of A. It is proved that almost all small sumsets of 1,2,...,n are B2[g]-sets, in the sense that if B2[g](k,n) denotes the number of B2[g]-sets of cardinality k contained in the interval 1,2,...,n, then limn∞ B2[g](k,n)/nk = 1 if k = o(ng/(2g+2)).
Create a lesson
Related papers
An ergodic approach to equations of the form x+y=α(n)
Vitaly Bergelson, Hao Pan, Saúl Rodríguez Martín
Rogers--Ramanujan identities from the geometry of Xa=Yb
Yifeng Huang, Kenny Lau, Ken Ono
Computational results on sums of a prime with squares or cubes
Kenny Applegate, Kyle Pratt
Finding New Limit Points of Mahler Measure by Methods of Missing Data Restoration
Jean-Marc Sac-Épée, Souad El Otmani, Armand Maul et al.
Low moments of automorphic random multiplicative function sums
Sun-Kai Leung
A problem of Yang and Chen on weighted representation functions
Shuang-Shuang Li, Ya-Ting Xu, Xiao-Hui Yan