arXiv · 0706.3250
Compact symmetric solutions to the postage stamp problem
Abstract
We derive lower and upper bounds on possible growth rates of certain sets of positive integers $A_k=\{1= a_1 < a_2 < ... < a_{k}\}$ such that all integers $n\in \{0, 1, 2, ..., ka_{k}\}$ can be represented as a sum of no more than $k$ elements of $A_k$, with repetition.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Hugh Thomas, Stephanie van Willigenburg. 2008-10-14. Compact symmetric solutions to the postage stamp problem. https://arxiv.org/abs/0706.3250
Cite the original work for its findings. Save a collection to share your selection of sources.