On the size and structure of -representable sumsets
arXiv:2304.08694 · doi:10.1016/j.disc.2024.114295
Abstract
Let be a finite set with minimum element , maximum element , and elements strictly in between. Write for the set of integers that can be written in at least ways as a sum of elements of . We prove that is "structured" for \[ h \geq (1+o(1)) \frac{1}{e} m\ell t^{1/\ell} \] (as , ), and prove a similar theorem on the size and structure of for sufficiently large. Moreover, we construct a family of sets for which is not structured for .
22 pages, 1 figure. Fixed proof of Lemma 1.3