On the number of sum-free subsets of the square grid
Abstract
Generalising the Cameron--Erdos conjecture to two dimensions, Elsholtz and Rackham conjectured that the number of sum-free subsets of [n]2 is 20.6n2+O(n). We prove their conjecture.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.