Two New Techniques for Computing Extremal h-bases Ak
Michael Farinton Challis · The Computer Journal · 1993
Ak={1, a2,...,a2} is an h-basis for n if every positive integer ≤n can be expressed as the sum of no more than h values ai; an extremal h-basis Ak; is one for which n is as large as possible. Computing such bases has become known as the Postage Stamp Problem, and this pager describes two new techniques—one appropriate for large k, and the other for large h—which help extend known results in both dimensions. The results themselves are presented as an Appendix.