English

The structure of large sum-free sets in $\mathbb{F}_p^n$

Combinatorics 2023-03-03 v1 Number Theory

Abstract

A set AFpnA\subset \mathbb{F}_p^n is sum-free if A+AA+A does not intersect AA. If p2mod3p\equiv 2 \mod 3, the maximal size of a sum-free in Fpn\mathbb{F}_p^n is known to be (pn+pn1)/3(p^n+p^{n-1})/3. We show that if a sum-free set AFpnA\subset \mathbb{F}_p^n has size at least pn/3pn1/6+pn2p^n/3-p^{n-1}/6+p^{n-2}, then there exists subspace V<FpnV<\mathbb{F}_p^n of co-dimension 1 such that AA is contained in (p+1)/3(p+1)/3 cosets of VV. For p=5p=5 specifically, we show the stronger result that every sum-free set of size larger than 1.25n11.2\cdot 5^{n-1} has this property, thus improving on a recent theorem of Lev.

Keywords

Cite

@article{arxiv.2303.00828,
  title  = {The structure of large sum-free sets in $\mathbb{F}_p^n$},
  author = {Leo Versteegen},
  journal= {arXiv preprint arXiv:2303.00828},
  year   = {2023}
}

Comments

15 pages