Folklore extremal conjecture for sum-free subsets of higher-dimensional grids

Let [n]={1,,n}[n]=\{1,\dots,n\}, let [n]d[n]^d carry coordinatewise addition, and let M([n]d)M([n]^d) be the maximum size of a sum-free subset. Let kdk_d be the maximal volume of a region in the unit cube [0,1]d[0,1]^d bounded between a hyperplane HH and its dilate 2H2\cdot H.

Higher-dimensional extremal conjecture.

M([n]d)=(kd+o(1))nd.M([n]^d)=(k_d+o(1))n^d.

The conjecture is known for d{3,4,5}d\in\{3,4,5\}, while it remains open for larger dimensions; a stronger proposed error term is not part of the conjecture recorded here.

Sources & referencesView supporting material

Primary source

Anubhab Ghosal, “On the number of sum-free subsets of the square grid”, arXiv:2510.15621 (2025).

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.