Let A be a subset of the d dimensional integer lattice and NA be the N-fold sumset. In 1992, Khovanskii proved that |NA| can be written as a polynomial in |A| of degree at most d, provided N is sufficiently large. We provide an effective bound for “sufficiently large”, and discuss some related results.
This is joint work with Andrew Granville and Aled Walker.
This video is part of the Webinar in Additive Combinatorics series, and this is their YouTube channel.
