Improved stability for the size and structure of sumsets
Abstract
Let A ⊂ Zd be a finite set. It is known that the sumset NA has predictable size ( NA = PA(N) for some PA(X) ∈ Q[X]) and structure (all of the lattice points in some finite cone other than all of the lattice points in a finite collection of exceptional subcones), once N is larger than some threshold. In previous work, joint with Shakan, the first and third named authors established the first effective bounds for both of these thresholds for an arbitrary set A. In this article we substantially improve each of these bounds, coming much closer to the corresponding lower bounds known.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.