On the number of sum-free subsets of the square grid
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917021650780160 |
|---|---|
| author | Ghosal, Anubhab |
| author_facet | Ghosal, Anubhab |
| contents | Generalising the Cameron--Erdős conjecture to two dimensions, Elsholtz and Rackham conjectured that the number of sum-free subsets of $[n]^2$ is $2^{0.6n^2+O(n)}$. We prove their conjecture. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_15621 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the number of sum-free subsets of the square grid Ghosal, Anubhab Combinatorics 11B75, 05A16 Generalising the Cameron--Erdős conjecture to two dimensions, Elsholtz and Rackham conjectured that the number of sum-free subsets of $[n]^2$ is $2^{0.6n^2+O(n)}$. We prove their conjecture. |
| title | On the number of sum-free subsets of the square grid |
| topic | Combinatorics 11B75, 05A16 |
| url | https://arxiv.org/abs/2510.15621 |