Open AccessTwo New Techniques for Computing Extremal h-bases Ak
Author(s) -
Michael Farinton Challis
Publication year - 1993
Publication title -
the computer journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/36.2.117
Subject(s) - pager , basis (linear algebra) , integer (computer science) , combinatorics , computer science , discrete mathematics , mathematics , geometry , operating system
A k ={1, a 2 ,..., a k } is an h-basis for n if every positive integer c n can be expressed as the sum of more than h values a i ; an extremal h-basis A k is one for which n is as large as possible. Computing such bases has become known as the Postage Stamp Problem, and this paper 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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom