English

A tight structure theorem for sumsets

Number Theory 2021-04-01 v2 Combinatorics

Abstract

Let A={0=a0<a1<<a+1=b}A = \{0 = a_0 < a_1 < \cdots < a_{\ell + 1} = b\} be a finite set of non-negative integers. We prove that the sumset NANA has a certain easily-described structure, provided that NbN \geqslant b-\ell, as recently conjectured by Shakan and the first author. We also classify those sets AA for which this bound cannot be improved.

Keywords

Cite

@article{arxiv.2006.01041,
  title  = {A tight structure theorem for sumsets},
  author = {Andrew Granville and Aled Walker},
  journal= {arXiv preprint arXiv:2006.01041},
  year   = {2021}
}

Comments

8 pages, minor changes to exposition. Accepted version

R2 v1 2026-06-23T15:57:59.743Z