Effective results on the size and structure of sumsets
Combinatorics
2023-07-18 v2 Number Theory
Abstract
Let be a finite set. It is known that has a particular size ( for some ) and structure (all of the lattice points in a cone other than certain exceptional sets), once is larger than some threshold. In this article we give the first effective upper bounds for this threshold for arbitrary . Such explicit results were only previously known in the special cases when , when the convex hull of is a simplex or when , results which we improve.
Cite
@article{arxiv.2105.09181,
title = {Effective results on the size and structure of sumsets},
author = {Andrew Granville and George Shakan and Aled Walker},
journal= {arXiv preprint arXiv:2105.09181},
year = {2023}
}
Comments
Small improvements to simplex case, following referee suggestions. To appear in Combinatorica