← All problems

Erdős Problem #155 — Eventual one-step growth of Sidon sets

1 year old · traced to

For a positive integer NN, write [N]={1,…,N}[N]=\{1,\ldots,N\}. In the B₂ convention for Sidon sets, a set AA is Sidon when the sums of its subsets of size at most two are all distinct: for B,C⊆AB,C\subseteq A with ∣B∣,∣C∣≤2|B|,|C|\leq 2, equality of sums implies B=CB=C. The empty subset is allowed, with sum zero. Define

F(N)=max⁡{∣A∣:A⊆[N] is Sidon}.F(N)=\max\{|A|: A\subseteq[N]\text{ is Sidon}\}.

The question is whether, for every fixed integer k≥1k\geq1, there is an integer N0(k)N_0(k) such that for every integer N≥N0(k)N\geq N_0(k),

F(N+k)≤F(N)+1.F(N+k)\leq F(N)+1.

Erdős Problems #155 Erdős (1980), A Survey of Problems in Combinatorial Number Theory

Background

Sidon introduced the B₂-sequence viewpoint around 1932–33 in connection with lacunary trigonometric series. For finite sets, the problem concerns how large a set inside an initial interval can be while retaining uniqueness of sums of at most two distinct elements. The question here asks for local control of this extremal function over every fixed interval length, not merely an estimate of its overall size. Erdős (1980), A Survey of Problems in Combinatorial Number Theory Erdős Problems #155

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.