2000 character limit reached
The Frobenius postage stamp problem, and beyond
Published 9 Mar 2020 in math.NT and math.CO | (2003.04076v2)
Abstract: Let $A$ be a finite subset of $\mathbb{Z}n$, which generates $\mathbb{Z}n$ additively. We provide a precise description of the $N$-fold sumsets $NA$ for $N$ sufficiently large, with some explicit bounds on "sufficiently large."
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.
