Erdős Problem #241 — Unique three-sum sets
For a positive integer , let be the largest cardinality of a set for which a sum of three elements determines the unordered multiset of its summands. Repetitions are allowed: equivalently, whenever satisfy
the multisets and must be equal. The question is whether
Erdős Problem #241 Green, The number of squares and Bₕ sets
Background
This is the problem with unique representations: in the usual 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 (); the analogous asymptotic order and leading constant are known in that case, whereas the general conjecture asks for maximum size asymptotic to . Erdős Problem #241 Green, The number of squares and Bₕ sets
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
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.