Enumeration of All Permutations of Multi‐Sets with Fixed Repetition Numbers

作者: Kenneth J. Berry

DOI: 10.2307/2347984

关键词: MathematicsEnumerationRepetition (rhetorical device)Combinatorics

摘要:

参考文章(18)
Gary D. Knott, A Numbering System for Permutations of Combinations. Communications of The ACM. ,vol. 19, pp. 355- 356 ,(1976)
A. D. Woodall, Generation of permutation sequences The Computer Journal. ,vol. 20, pp. 346- 349 ,(1977) , 10.1093/COMJNL/20.4.346
P. Bratley, Algorithm 306: permutations with repetitions Communications of The ACM. ,vol. 10, pp. 450- 451 ,(1967) , 10.1145/363427.363473
Jerome Kurtzberg, Algorithm 94: Combination Communications of The ACM. ,vol. 5, pp. 344- ,(1962) , 10.1145/367766.368162
F. M. Ives, Permutation enumeration Communications of the ACM. ,vol. 19, pp. 68- 72 ,(1976) , 10.1145/359997.360002
Phillip J. Chase, Algorithm 382: combinations of M out of N objects [G6] Communications of the ACM. ,vol. 13, pp. 368- ,(1970) , 10.1145/362384.362502
C. N. Liu, D. T. Tang, Algorithm 452: enumerating combinations of m out of n objects [G6] Communications of the ACM. ,vol. 16, pp. 485- ,(1973) , 10.1145/355609.362322
J. S. Rohl, Generating permutations by choosing The Computer Journal. ,vol. 21, pp. 302- 305 ,(1978) , 10.1093/COMJNL/21.4.302