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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.