Direct and Inverse Theorems on Signed Sumsets of Integers
Abstract
Let G be an additive abelian group and h be a positive integer. For a nonempty finite subset A=\a0, a1,…, ak-1\ of G, we let \[h+A:=\i=0k-1λi ai: (λ0, …, λk-1) ∈ Zk,~ i=0k-1|λi|=h \,\] be the signed sumset of A. The direct problem for the signed sumset h+A is to find a nontrivial lower bound for |h+A| in terms of |A|. The inverse problem for h+A is to determine the structure of the finite set A for which |h+A| is minimal. In this article, we solve both the direct and inverse problems for |h+A|, when A is a finite set of integers.
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.