On Lev's periodicity conjecture
Abstract We classify the sum‐free subsets of whose density exceeds . This yields a resolution of Vsevolod Lev's periodicity conjecture, which asserts that if a sum‐free subset is maximal with respect to inclusion and aperiodic (in the sense that there is no non‐zero vector satisfying ), then —a bound known to be optimal if , while for there are no such sets.
Authors
- Christian Reiher (ORCID: https://orcid.org/0000-0002-1793-3865)
Institutions
- Universität Hamburg (DE)
Publication Details
- Journal
- Bulletin of the London Mathematical Society
- Published
- 2025-03-20
- DOI
- https://doi.org/10.1112/blms.70043
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00