The limiting density of the largest sum-free subset of {1,2,…,n}^d is achieved by two appropriate hyperplane slices for every dimension d.
Stochastic Modelling and Applied Probability
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 limiting density of the largest sum-free subset of {1,2,…,n}^d is achieved by two appropriate hyperplane slices for every dimension d.