Papers
Topics
Authors
Recent
Search
2000 character limit reached

The structure of higher sumsets

Published 7 Oct 2021 in math.NT | (2110.03554v2)

Abstract: Merging together a result of Nathanson from the early 70s and a recent result of Granville and Walker, we show that for any finite set $A$ of integers with $\min(A)=0$ and $\gcd(A)=1$ there exist two sets, the "head" and the "tail", such that if $m\ge\max(A)-|A|+2$, then the $m$-fold sumset $mA$ consists of the union of these sets and a long block of consecutive integers separating them. We give sharp estimates for the length of the block, and investigate the corresponding stability problem classifying those sets $A$ for which the bound $\max(A)-|A|+2$ cannot be substantially improved.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.