← All problems

Erdős Problem #241 — Unique three-sum sets

52 years old · documented by

For a positive integer NN, let f(N)f(N) be the largest cardinality of a set A⊆{1,…,N}A\subseteq\{1,\ldots,N\} for which a sum of three elements determines the unordered multiset of its summands. Repetitions are allowed: equivalently, whenever a1,a2,a3,b1,b2,b3∈Aa_1,a_2,a_3,b_1,b_2,b_3\in A satisfy

a1+a2+a3=b1+b2+b3,a_1+a_2+a_3=b_1+b_2+b_3,

the multisets {a1,a2,a3}\{a_1,a_2,a_3\} and {b1,b2,b3}\{b_1,b_2,b_3\} must be equal. The question is whether

lim⁡N→∞f(N)N1/3=1.\lim_{N\to\infty}\frac{f(N)}{N^{1/3}}=1.

Erdős Problem #241 Green, The number of squares and Bₕ sets

Background

This is the B3B_3 problem with unique representations: in the usual BhB_h terminology, sums are counted up to permutation, and repeated summands are permitted. The question is credited to Bose as having been posed to Erdős. Its two-summand counterpart is the Sidon-set problem (B2B_2); the analogous asymptotic order and leading constant are known in that case, whereas the general BhB_h conjecture asks for maximum size asymptotic to N1/hN^{1/h}. Erdős Problem #241 Green, The number of squares and Bₕ sets

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.