On the size and structure of $t$-representable sumsets
Combinatorics
2024-12-18 v3 Number Theory
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 (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 .
Keywords
Cite
@article{arxiv.2304.08694,
title = {On the size and structure of $t$-representable sumsets},
author = {Christian Táfula},
journal= {arXiv preprint arXiv:2304.08694},
year = {2024}
}
Comments
22 pages, 1 figure. Fixed proof of Lemma 1.3