← All problems

Erdős Problem #158 — Density of sets with bounded additive representations

31 years old · documented by

Let N={1,2,…}\mathbb N=\{1,2,\ldots\}, and let A⊆NA\subseteq\mathbb N be infinite. For each n∈Nn\in\mathbb N, define the number of unordered representations of nn by elements of AA as

rA(n)=#{(a,b)∈A2:a≤b, a+b=n}.r_A(n)=\#\{(a,b)\in A^2:a\leq b,\ a+b=n\}.

Assume that rA(n)≤2r_A(n)\leq 2 for every n∈Nn\in\mathbb N. Must the counting function of AA satisfy

lim inf⁡N→∞#(A∩{1,…,N})N=0,\liminf_{N\to\infty}\frac{\#(A\cap\{1,\ldots,N\})}{\sqrt N}=0,

where NN tends to infinity through positive integers? Erdős Problem #158

Background

The multiplicity bound is on unordered representations: each pair is counted once by imposing a≤ba\leq b. The stricter bound rA(n)≤1r_A(n)\leq1 is the Sidon-set condition. The problem is associated with the 1994 paper by Erdős, Sárközy, and Sós, “On Sum Sets of Sidon Sets, I.” Erdős Problem #158 Erdős, Sárközy, and Sós (1994)

References

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.