2000 character limit reached
Effective results on the size and structure of sumsets
Published 19 May 2021 in math.CO and math.NT | (2105.09181v2)
Abstract: Let $A \subset \mathbb{Z}d$ be a finite set. It is known that $NA$ has a particular size ($\vert NA\vert = P_A(N)$ for some $P_A(X) \in \mathbb{Q}[X]$) and structure (all of the lattice points in a cone other than certain exceptional sets), once $N$ is larger than some threshold. In this article we give the first effective upper bounds for this threshold for arbitrary $A$. Such explicit results were only previously known in the special cases when $d=1$, when the convex hull of $A$ is a simplex or when $\vert A\vert = d+2$, results which we improve.
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.