Sharp sumset lower-bound conjecture for hypercubes

About 23 years old · traced to

Let n,m,dn,m,d be positive integers, let [m]:={0,1,…,m}[m]:=\{0,1,\ldots,m\}, and let A1,…,AnA_1,\ldots,A_n be finite subsets of [m]d[m]^d. Define

pn,m:=nlog⁡(m+1)mlog⁡(n+1).p_{n,m}:=\frac{n\log(m+1)}{m\log(n+1)}.

Sharp sumset lower-bound conjecture. The inequality

∣A1+⋯+An∣≥(∣A1∣⋯∣An∣)1/p|A_1+\cdots+A_n|\geq (|A_1|\cdots|A_n|)^{1/p}

holds with p=pn,mp=p_{n,m}.

The conjecture asks for the sharp exponent in lower bounds for Minkowski sums of subsets of a hypercube. The paper states that it resolves this conjecture in full generality, so the conjecture is solved.

References

Primary source

Felipe Gonçalves and Danylo Radchenko, “Sharp Lower Bounds for Sumsets in Hypercubes”, arXiv:2607.01458 (2026).

Additional references

17 papers in this index state this conjecture (2003–2026). The statement above is taken from the most recent of them; the others are arXiv:2604.15974, arXiv:2603.14227, arXiv:2506.09903, arXiv:2411.17362, arXiv:2303.05626, arXiv:2204.05287, arXiv:2203.10025, arXiv:2201.00104, arXiv:2111.02208, arXiv:2105.02524, arXiv:2001.00653, arXiv:1912.03875, and 4 more.

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.