Large sum-free sets in finite vector spaces I

Abstract

Let p be a prime number with p 23 and let n 1 be a dimension. It is known that a sum-free subset of Fpn can have at most the size 13(p+1)pn-1 and that, up to automorphisms of Fpn, the only extremal example is the `cuboid' [p+13, 2p-13]× Fpn-1. For p 11 we show that if a sum-free subset of Fpn is not contained in such an extremal one, then its size is at most 13(p-2)pn-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 13 it is less interesting.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…