Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Lev's periodicity conjecture

Published 27 Aug 2024 in math.CO and math.NT | (2408.15174v2)

Abstract: We classify the sum-free subsets of ${\mathbb F}_3n$ whose density exceeds $\frac16$. This yields a resolution of Vsevolod Lev's periodicity conjecture, which asserts that if a sum-free subset ${A\subseteq {\mathbb F}_3n}$ 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|\le \frac12(3{n-1}+1)$ -- a bound known to be optimal if $n\ne 2$, while for $n=2$ there are no such sets.

Authors (1)
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.