On Lev's periodicity conjecture
Abstract
We classify the sum-free subsets of F3n whose density exceeds 16. This yields a resolution of Vsevolod Lev's periodicity conjecture, which asserts that if a sum-free subset A⊂eq F3n is maximal with respect to inclusion and aperiodic (in the sense that there is no non-zero vector v satisfying A+v=A), then |A| 12(3n-1+1) -- a bound known to be optimal if n 2, while for n=2 there are no such sets.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.