English

Explicit sumset sizes in additive number theory

Number Theory 2026-04-07 v5

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 RZ(h,k)={hA:AZ and A=k}\mathcal{R}_{\mathbf{Z}}(h,k)= \{|hA|:A \subseteq {\mathbf{Z}} \text{ and } |A|=k\} for all integers h3h \geq 3 and k3k \geq 3. This paper constructs certain infinite families of finite sets of size kk and computes their hh-fold sumset sizes.

Keywords

Cite

@article{arxiv.2505.05329,
  title  = {Explicit sumset sizes in additive number theory},
  author = {Melvyn B. Nathanson},
  journal= {arXiv preprint arXiv:2505.05329},
  year   = {2026}
}

Comments

11 pages; minor revisions

R2 v1 2026-06-28T23:25:54.763Z