The Frobenius postage stamp problem, and beyond
Number Theory
2020-04-28 v2 Combinatorics
Abstract
Let be a finite subset of , which generates additively. We provide a precise description of the -fold sumsets for sufficiently large, with some explicit bounds on "sufficiently large."
Cite
@article{arxiv.2003.04076,
title = {The Frobenius postage stamp problem, and beyond},
author = {Andrew Granville and George Shakan},
journal= {arXiv preprint arXiv:2003.04076},
year = {2020}
}
Comments
14 pages, v2 added Theorem 3