Home → Magazine Archive → June 1973 (Vol. 16, No. 6) → Algorithm 448: number of multiply-restricted partitions → Abstract

Algorithm 448: number of multiply-restricted partitions

By Terry Beyer, D. F. Swinehart

Communications of the ACM, Vol. 16 No. 6, Page 379

Given a positiver integer m and an ordered k-tuple c = (c1, ··· , ck) of not necessarily distinct positive integers, then any ordered k-tuple s = (s1, ··· , sk) of nonnegative integers such that m = ∑ki-1 sici is said to be a partition of m restricted to c. Let Pc(m) denote the number of distinct partitions of m restricted to c. The subroutine COUNT, when given a k-tuple c and an integer n, computes an array of the values of Pc(m) for m = 1 to n. Many combinatorial enumeration problems may be expressed in terms of the numbers Pc(m). We mention two below.

The full text of this article is premium content


No entries found