Size of the largest sum-free subset of $[n]^3$ and $[n]^4$
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918250845044736 |
|---|---|
| author | Lepsveridze, Saba Sun, Yihang |
| author_facet | Lepsveridze, Saba Sun, Yihang |
| contents | 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$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_18289 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Size of the largest sum-free subset of $[n]^3$ and $[n]^4$ Lepsveridze, Saba Sun, Yihang Combinatorics 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$. |
| title | Size of the largest sum-free subset of $[n]^3$ and $[n]^4$ |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2311.18289 |