Iterated sumset expansion in Fpn
Abstract
Given a set A ⊂eq Fpn, what conditions does one need to guarantee that iterated sumsets of the form A+·s+A expand quickly (say, within O(p) terms) to the whole space? When only the size of A is known, such expansion results are only possible when |A|>1p|Fpn|. However, heuristic considerations suggest that expansion should begin with much smaller sets under just mild ``nondegeneracy'' conditions. In this paper, we confirm this intuition by showing a sufficient algebraic condition for the asymmetric version of this problem: We have A1+…+Am=Fpn as long as each Ai is not contained in the zero set of any low degree polynomial (deg = O(n) when m=O(p)). We close with a discussion of the behavior of random sets, as well as extensions of these results and connections with the Erdos-Ginzburg-Ziv problem. Our proofs make use of the shift operator polynomial method developed by the second author.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.