Terry Beyer
Abstract
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.
- 1 Hall, M. Jr. Combinatorial Theory. Blaisdell, Waltham, Mass., 1967, pp. 29-35.Google Scholar
- 2 Marcus, R.A., and Rice, O.K. The Kinetics of the recombination of methyl radicals and iodine atoms. J. Physical and Colloid Chem. 55 (June 1951), 894-908.Google ScholarCross Ref
- 3 McKay, J.K.S. Algorithm 262, Number of restricted partitions of N. Comm. ACM 8 (Aug. 1965), 493. Google ScholarDigital Library
- 4 White, J.S. Algorithm 373. Number of doubly restricted partitions. Comm. ACM 13 (Feb. 1970), 120. Google ScholarDigital Library
- 5 Whitten, G.Z., and Rabinovitch, B.S. Accurate and facile approximation for vibrational energy-level sums. a r. Chem. Phys. 38 (15 May 1963), 2466-2473.Google Scholar
- 6 Wieder, G.M., and Marcus, R.A. Dissociation and isomerization of vibrationally excited species. II. Unimolecular reaction rate theory and its application. J. Chem. Phys. 37 (15 Oct. 1962), 1835-1852.Google ScholarCross Ref
Recommendations
Restricted Dumont permutations, Dyck paths, and noncrossing partitions
We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some combinatorial statistics on Dumont permutations avoiding certain patterns ...
Parity biases in partitions and restricted partitions
AbstractLet p o ( n ) (resp. p e ( n )) denote the number of partitions of n with more odd parts (resp. even parts) than even parts (resp. odd parts). Recently, Kim, Kim and Lovejoy proved that p o ( n ) > p e ( n ) for all n > 2 and ...
An involution for symmetry of hook length and part length of pointed partitions
A pointed partition of n is a pair (@l,v), where @l is a partition of n and v is a cell in its Ferrers diagram. In this paper, an involution on pointed partitions of n exchanging hook length and part length is constructed. This gives a bijective proof ...
Comments