Generalized H-fold sumset and Subsequence sum

Abstract

Let $A$ and $H$ be nonempty finite sets of integers and positive integers, respectively. The generalized $H$-fold sumset, denoted by $H^{(r)}A$, is the union of the sumsets $h^{(r)}A$ for $h\in H$ where, the sumset $h^{(r)}A$ is the set of all integers that can be represented as a sum of $h$ elements from $A$ with no summand in the representation appearing more than $r$ times. In this paper, we find the optimal lower bound for the cardinality of $H^{(r)}A$, i.e., for $|H^{(r)}A|$ and the structure of the underlying sets $A$ and $H$ when $|H^{(r)}A|$ is equal to the optimal lower bound in the cases $A$ contains only positive integers and $A$ contains only nonnegative integers. This generalizes recent results of Bhanja. Furthermore, with a particular set $H$, since $H^{(r)}A$ generalizes subsequence sum and hence subset sum, we get several results of subsequence sums and subset sums as special cases.

Theorems & Definitions (34)

• Theorem 1.1
• Theorem 1.2
• Theorem 1.3
• Theorem 1.4
• Theorem 1.5
• Theorem 1.6
• Theorem 1.7
• Theorem 1.8
• Theorem 2.1
• proof