The structure of large sum-free sets in Fpn
Abstract
A set A⊂ Fpn is sum-free if A+A does not intersect A. If p 2 3, the maximal size of a sum-free in Fpn is known to be (pn+pn-1)/3. We show that if a sum-free set A⊂ Fpn has size at least pn/3-pn-1/6+pn-2, then there exists subspace V<Fpn of co-dimension 1 such that A is contained in (p+1)/3 cosets of V. For p=5 specifically, we show the stronger result that every sum-free set of size larger than 1.2· 5n-1 has this property, thus improving on a recent theorem of Lev.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.