arXiv · 1503.03416
Early Pruning in the Restricted Postage Stamp Problem
Abstract
A set of non-negative integers is an additive basis with range $n$, if its sumset covers all consecutive integers from 0 to $n$, but not $n+1$. If the range is exactly twice the largest element of the basis, the basis is restricted. Restricted bases have important special properties that facilitate efficient searching. With the help of these properties, we have previously listed the extremal restricted bases up to length $k = 41$. Here, with a more prudent use of the properties, we present an improved search algorithm and list all extremal restricted bases up to $k = 47$.
Explore related subjects
Keep this discovery
Jukka Kohonen. 2015-03-11. Early Pruning in the Restricted Postage Stamp Problem. https://arxiv.org/abs/1503.03416
Cite the original work for its findings. Save a collection to share your selection of sources.