Optimal representations by sumsets and subset sums
Let \(A\) be a set of non-negative integers; then the cardinality of \(hA\), \(h\geq 2\) and integral, is estimated from below giving an application in connection with the Frobenius problem. Furthermore, it is shown that \(hA\) always contains chains of consecutive integers with a certain length. This leads to an estimation for the number of summands required in a representation of an integer by a sum of elements of \(A\).
scientific article; zbMATH DE number 992098