← All problems

Erdős Problem #1206 — Linear-sized Sidon subsets of cubes

46 years old · traced to

A set B of integers is Sidon if every equality a_1+a_2=a_3+a_4 with a_i∈B has {a_1,a_2}={a_3,a_4}; repetitions among the summands are allowed. For each positive integer N, write C_N={n^3:1≤n≤N}. The finite question is whether there is an absolute constant c>0 such that, for every N≥1, C_N has a Sidon subset B_N satisfying Erdős Problems #1206 On Sidon sets with squares, cubes and quartics in short intervals (arXiv:2602.08807)

∣BN∣≥cN.|B_N|\ge cN.

Erdős Problems #1206 On Sidon sets with squares, cubes and quartics in short intervals (arXiv:2602.08807)

The associated infinite-direction question asks whether there is a positive-density set A⊆ℕ for which {a^3:a∈A} is Sidon. Erdős Problems #1206 On Sidon sets with squares, cubes and quartics in short intervals (arXiv:2602.08807)

Background

Erdős recorded the cube question in his 1980 survey. In the same discussion he defined g_k(A) as the largest size of a Sidon subset of {a^k:a∈A}, and asked how this quantity compares with g_k({1,…,N}) when N=|A|. This places the cube problem in a broader study of how the arithmetic structure of the exponents’ input set affects the size of Sidon subsets. The full set of cubes is not Sidon: nontrivial equalities between sums of two cubes prevent taking all of C_N as the desired subset. Erdős (1980) On Sidon sets with squares, cubes and quartics in short intervals (arXiv:2602.08807)

The problem also sits alongside questions about other powers. Erdős’s survey notes a conjecture that the fifth powers themselves form a Sidon set; a related result of Ruzsa, as summarized in the later paper, constructs a Sidon sequence by adding a suitable integer part of ξn^4 to n^5 for some ξ∈[0,1]. These are distinct from the cube question, which seeks a large Sidon subset rather than requiring the entire power sequence to be Sidon. Erdős (1980) On Sidon sets with squares, cubes and quartics in short intervals (arXiv:2602.08807)

References

P. Erdős, A survey of problems in combinatorial number theory, Annals of Discrete Mathematics 6 (1980), 89–115.

Source: P. Erdős, A survey of problems in combinatorial number theory, Annals of Discrete Mathematics 6 (1980), 89–115.

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.