English

On Lev's periodicity conjecture

Combinatorics 2025-02-05 v2 Number Theory

Abstract

We classify the sum-free subsets of F3n{\mathbb F}_3^n whose density exceeds 16\frac16. This yields a resolution of Vsevolod Lev's periodicity conjecture, which asserts that if a sum-free subset AF3n{A\subseteq {\mathbb F}_3^n} is maximal with respect to inclusion and aperiodic (in the sense that there is no non-zero vector vv satisfying A+v=AA+v=A), then A12(3n1+1)|A|\le \frac12(3^{n-1}+1) -- a bound known to be optimal if n2n\ne 2, while for n=2n=2 there are no such sets.

Keywords

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

R2 v1 2026-06-28T18:25:37.679Z