The largest sum-free subset of [n]^d has limiting density achieved by two hyperplane slices; equivalently, the maximum measure of a sum-free set in the unit hypercube is attained by a linear functional slice between 1 and 2.
100 open problems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the largest sum-free subset of the lattice cube
The largest sum-free subset of [n]^d has limiting density achieved by two hyperplane slices; equivalently, the maximum measure of a sum-free set in the unit hypercube is attained by a linear functional slice between 1 and 2.