On the largest sum-free subset of the lattice cube
Combinatorics
2026-05-04 v1 Number Theory
Abstract
We determine the limiting density of the largest sum-free subset of the lattice cube for all , thus resolving the natural conjecture that it is constructed by two appropriate hyperplane slices.
Cite
@article{arxiv.2605.00816,
title = {On the largest sum-free subset of the lattice cube},
author = {Peter Keevash and Jeck Lim},
journal= {arXiv preprint arXiv:2605.00816},
year = {2026}
}
Comments
17 pages