arXiv Analytics

Sign in

arXiv:2406.03275 [math.CO]AbstractReferencesReviewsResources

Improved stability for the size and structure of sumsets

Andrew Granville, Jack Smith, Aled Walker

Published 2024-06-05Version 1

Let $A \subset \mathbb{Z}^d$ be a finite set. It is known that the sumset $NA$ has predictable size ($\vert NA\vert = P_A(N)$ for some $P_A(X) \in \mathbb{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.

Related articles: Most relevant | Search more
arXiv:0811.1311 [math.CO] (Published 2008-11-09, updated 2009-10-29)
Squares in sumsets
arXiv:math/9802122 [math.CO] (Published 1998-02-27)
Tiling the integers with translates of one finite set
arXiv:0707.0004 [math.CO] (Published 2007-06-29)
An Algorithm to Construct A Basis for the Module of Logarithmic Vector Fields