摘要

Let h >= 2 be a fixed integer. For a positive integer N, a set A subset of [0,N] boolean AND Z is called an h-basis for N if every integer n is an element of [0,N] can be represented as n = a(1) + a(2) + ... + a(h), where a(j) is an element of A, j = 1, 2,..., h. In this paper, we improve the existing lower bound estimates for the cardinality of an additive h-basis for N, as N -> infinity.

  • 出版日期2015-11