English

Large sum-free sets in finite vector spaces I

Combinatorics 2024-08-29 v2

Abstract

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

Keywords

Cite

@article{arxiv.2408.11232,
  title  = {Large sum-free sets in finite vector spaces I},
  author = {Christian Reiher and Sofia Zotova},
  journal= {arXiv preprint arXiv:2408.11232},
  year   = {2024}
}

Comments

added acknowledgement

R2 v1 2026-06-28T18:18:49.429Z