Paperlane

no. 12 · Tuesday 10 November 2026

Gaps in the Most Frequent Sizes of Integer Sumsets

Saad A. Awan, Steven J. Miller, Linh Nguyen, Steven Senger and Elvis Wong

math.CO · v2 · □ lean · 19 pp

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.

comments
19 pages. Lean 4 formalization included as ancillary files
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2611.07303 ↗