Sumsets as unions of sumsets of subsets

Abstract

Let S and T be subsets of Fqn. We show there are subsets S' of S and T' of T such that S+T is the union of S+T' and S'+T, with |S'| + |T'| bounded by cn with c < q. The proof relies on the method of Croot-Lev-Pach and Ellenberg-Gijswijt on the cap set problem, together with a result of Meshulam on linear spaces of low-rank matrices. The result is a modest generalization of the recent bounds on (single-colored and multi-colored) sum-free sets by the author and others.

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…