Size of the Largest Sum-Free Subset of [ n ]3 and [ n ]4
International Mathematics Research Notices · 07.05.2026 · 2026 (9)
DOI: 10.1093/imrn/rnag081 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Mathematics Research Notices, online erschienen am 24.04.2026. Verfasst von Saba Lepsveridze und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 12 Literaturangaben.
Abstract (Originalsprache)
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$.
Zitieren
APA
Lepsveridze, S., & Sun, Y. (2026). Size of the Largest Sum-Free Subset of [ n ]3 and [ n ]4. International Mathematics Research Notices, 2026(9). https://doi.org/10.1093/imrn/rnag081
Vancouver
Lepsveridze S, Sun Y. Size of the Largest Sum-Free Subset of [ n ]3 and [ n ]4. International Mathematics Research Notices. 2026;2026(9). doi:10.1093/imrn/rnag081
BibTeX
@article{Lepsveridze2026,
author = {Lepsveridze, Saba and Sun, Yihang},
title = {Size of the Largest Sum-Free Subset of [ n ]3 and [ n ]4},
journal = {International Mathematics Research Notices},
year = {2026},
volume = {2026},
number = {9},
doi = {10.1093/imrn/rnag081}
}
EUVIMED