arXiv · 2611.07303
Gaps in the Most Frequent Sizes of Integer Sumsets
Abstract
Nathanson observed that, for four-element sets $A$ of integers, the most frequent sizes of the iterated sumset $hA$ are separated by triangular numbers. Senger proved this and suggested an analogue for larger sets. We establish this pattern for $k$-element subsets of $\{1,\ldots,q\}$, for every fixed $k\geq3$, where $h\geq2$ is either fixed or grows slower than $q^{1/(2k-1)}$. As $q\to\infty$, almost every such set has the largest possible $h$-fold sumset, and almost every exception has one of $h-1$ explicit smaller sizes. The differences between consecutive sizes among these $h$ values are consecutive $(k-2)$-dimensional simplex numbers.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Saad A. Awan, Steven J. Miller, Linh Nguyen, Steven Senger, Elvis Wong. 2026-11-09. Gaps in the Most Frequent Sizes of Integer Sumsets. https://searcharxiv.com/abs/2611.07303
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.