On the structure of the h-fold sumsets
Abstract
Let~A be a set of nonnegative integers. Let~(h A)(t) be the set of all integers in the sumset~hA that have at least~t representations as a sum of~h elements of~A. In this paper, we prove that, if~k ≥ 2, and~A=\a0, a1, …, ak\ is a finite set of integers such that~0=a0<a1<·s<ak and (a1, a2,…, ak)=1, then there exist integers ~ct,dt and sets~Ct⊂eq[0, ct-2], Dt ⊂eq[0, dt-2] such that (h A)(t)=Ct [ct, h ak-dt] (h ak-1-Dt) for all~h ≥Σi=2k(tai-1)-1. This improves a recent result of Nathanson with the bound h ≥ (k-1)(t ak-1) ak+1.
0