Size of the largest sum-free subset of [n]³ and [n]⁴

2023/11/30 by Lepsveridze, Saba, Sun, Yihang · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2311.18289

Abstract

We determine the density of the largest sum-free subset of the lattice cube \1, 2, …, n\^d for d = 3 and d = 4. This solves a conjecture of Cameron and Aydinian in dimensions 3 and 4.

Cited by

• On the number of sum-free subsets of the square grid

Related

• On the largest sum-free subset problem in the integers
• Shape of the asymptotic maximum sum-free sets in integer lattice grids
• Sharp bound on the number of maximal sum-free subsets of integers
• On the squarefree values of a⁴+b³
• On the number of sum-free subsets of the square grid