On the largest sum-free subset of the lattice cube

Abstract

We determine the limiting density of the largest sum-free subset of the lattice cube $\{1,2,\dots ,n{\}}^d$ for all $d$, thus resolving the natural conjecture that it is constructed by two appropriate hyperplane slices. Equivalently, we show that the largest measure of a sum-free subset of the hypercube $(0,1{)}^d\subset {\mathbb{R}}^d$ is attained by $\setcond{x\in (0,1)^d}{1\leq L(x)<2}$ for some linear map $L:{\mathbb{R}}^d\to \mathbb{R}$. It is natural to conjecture that the same phenomenon might hold if one replaces the hypercube by any convex set not containing the origin, but we give an example to show that for sufficiently large $d$ this is not the case.

18 pages