2000 character limit reached
A tight structure theorem for sumsets
Published 1 Jun 2020 in math.NT and math.CO | (2006.01041v2)
Abstract: Let $A = {0 = a_0 < a_1 < \cdots < a_{\ell + 1} = b}$ be a finite set of non-negative integers. We prove that the sumset $NA$ has a certain easily-described structure, provided that $N \geqslant b-\ell$, as recently conjectured by Shakan and the first author. We also classify those sets $A$ for which this bound cannot be improved.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.