Sumsets with a minimum number of distinct terms (Q6941716)

For a set \(A\) of \(k\) elements from an additive abelian group \(G\) and a positive integer \(r \leq k\), let \(h^{(\geq r)}A\) be the set of elements of \(G\) that can be written as a sum of \(h\) elements of \(A\) with at least \(r\) distinct elements. In this paper, the author gives an upper bound for the minimum size of \(h^{(\geq r)}A\) over \(\mathbb{Z}_m\) for \(m\geq 2\). Further, the author provides the sharp lower bound on the size of \(h^{(\geq r)}A\) and characterize the set \(A\) for which the lower bound on the size of \(h^{(\geq r)}A\) is tight over the groups \(\mathbb{Z}\) and \(\mathbb{Z}_p\), where \(p\) is a prime number.