On Lev's periodicity conjecture
Combinatorics
2025-02-05 v2 Number Theory
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.
Cite
@article{arxiv.2408.15174,
title = {On Lev's periodicity conjecture},
author = {Christian Reiher},
journal= {arXiv preprint arXiv:2408.15174},
year = {2025}
}
Comments
revised according to referee report