-complementing subsets of nonnegative integers补充的子集非负整数.pdfVIP

k-COMPLEMENTING SUBSETS OF NONNEGATIVE INTEGERS AUGUSTINE O. MUNAGI Received 9 September 2004 A collection {S , S , ...} of nonempty sets is called a complementing system of subsets 1 2 for a set X of nonnegative integers if every element of X can be uniquely expressed as a sum of elements of the sets S , S , We present a complete characterization of all 1 2 complementing systems of subsets for the set of the first n nonnegative integers as well as an explicit enumeration formula. 1. Introduction Let S = {S , S , ...} represent a collection of nonempty sets of nonnegative integers in 1 2 which each member contains the integer 0. Then S is called a complementing system of subsets for X ⊆ {0,1, ...} if every x ∈ X can be uniquely represented as x = s1 + s2 + ··· with s ∈ S . We will also write X = S ⊕ S ⊕ ··· and, when necessary, refer to X as the i i 1 2 direct sum of the Si . We will denote the set of all complementing systems for X by CS(X ). Then {X } ∈ CS(X ) = ∅. If there is a positive integer k such that X = S ⊕ ··· ⊕ S , then {S , ... , S } will be 1 k 1 k called a k-complementing system of subsets, or a complementing k-tuple, for X . Denote the set of all complementing k-tuples for X by CS(k,X ). We will address the problem of characterizing all S ∈ CS(k, N ), where N = {0,1, ... , n n n − 1}. The corresponding more general problem for CS(N) was solved by de Bruijn [2], where N = {0,1, ...}. Long [4] has given a complete solution for CS(2, N ). Since the n a