Size of the largest sum-free subset of $[n]^3$ and $[n]^4$
![Size of the largest sum-free subset of $[n]^3$ and $[n]^4$](/en/posts/2025/12/2025-12-16-2311_18289/featured_v26.webp)
Notice: This research summary and analysis were automatically generated using AI technology. For absolute accuracy, please refer to the [Original Paper Viewer] below or the Original ArXiv Source.
We determine the density of the largest sum-free subset of the lattice cube ${1, 2, \dots, n}^d$ for $d = 3$ and $d = 4$. This solves a conjecture of Cameron and Aydinian in dimensions $3$ and $4$.
💡 Research Summary
The paper determines the asymptotic density of the largest sum‑free subset of the discrete cube (
Comments & Academic Discussion
Loading comments...
Leave a Comment