Papers
Topics
Authors
Recent
2000 character limit reached

Large sum-free sets in finite vector spaces I

Published 20 Aug 2024 in math.CO | (2408.11232v2)

Abstract: Let $p$ be a prime number with $p\equiv 2\pmod{3}$ and let $n\ge 1$ be a dimension. It is known that a sum-free subset of ${\mathbb F}_pn$ can have at most the size $\frac13(p+1)p{n-1}$ and that, up to automorphisms of ${\mathbb F}_pn$, the only extremal example is the `cuboid' $\bigl[\frac{p+1}3, \frac{2p-1}3\bigr]\times {\mathbb F}_p{n-1}$. For $p\ge 11$ we show that if a sum-free subset of ${\mathbb F}_pn$ is not contained in such an extremal one, then its size is at most $\frac13(p-2)p{n-1}$. This bound is optimal and we classify the extremal configurations. The remaining cases $p=2, 5$ are known to behave differently. For $p=3$ the analogous question was solved by Vsevolod Lev, and for $p\equiv 1\pmod{3}$ it is less interesting.

Citations (1)

Summary

Paper to Video (Beta)

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.

Authors (2)

Collections

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

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.