Explicit sumset sizes in additive number theory
Abstract It is an open problem in additive number theory to compute and understand the full range of sumset sizes of finite sets of integers, that is, the set $ \mathcal R_{\mathbf Z}(h,k) = \{|hA|:A \subseteq \mathbf Z \text { and } |A|=k\}$ for all integers $h \geq 3$ and $k \geq 3$ . This article constructs certain infinite families of finite sets of size k , computes their h -fold sumset sizes, and obtains explicit finite arithmetic progressions of sumset sizes in $ \mathcal R_{\mathbf Z}(h,k)$ .
Authors
- Melvyn B. Nathanson (ORCID: https://orcid.org/0000-0002-6191-9374)
Institutions
- Lehman College (US)
- City University of New York (US)
Publication Details
- Journal
- Canadian Mathematical Bulletin
- Published
- 2025-12-04
- DOI
- https://doi.org/10.4153/s0008439525101549
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- City University of New York