Algorithm 448: number of multiply-restricted partitions
By Terry Beyer, D. F. Swinehart
Communications of the ACM,
Vol. 16 No. 6, Page 379
10.1145/362248.362275
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-1sici 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
0 Comments
No entries found
Log in to Read the Full Article
Purchase the Article
Log in
Create a Web Account
If you are an ACM member, Communications subscriber, Digital Library subscriber, or use your institution's subscription, please set up a web account to access premium content and site
features. If you are a SIG member or member of the general public, you may set up a web account to comment on free articles and sign up for email alerts.