Literature Cited
V. I. Mudrov, “Algorithm for numbering combinations,” Zh. Vychisl. Mat. Mat. Fiz., No. 4 (1965).
I. Ya. Akushskii and V. N. Zabolotskii, “On the combinatorial approach to the idea of compressing information,” in: Digital Computers and Programming [in Russian], Vol. 6, Sov. Radio, Moscow (1971).
N. V. Semakov and V. A. Zinov'ev, “Constant-weight codes and tactical configurations,” Probl. Peredachi Inform.,5, No. 3 (1969).
M. D. Venediktov, V. V. Markov, and G. S. Éidus, Asynchronous Addressed Communications Systems [in Russian], Svyaz., Moscow (1968).
B. M. Zlotnik, “Algorithm for numbering permutations with bounded repetitions,” Kibernetika, No. 5 (1971).
B. M. Zlotnik, “Algorithm for numbering permutations,” Avtomat. Vychisl. Tekh., No. 2 (1972).
B. M. Zlotnik, “Algorithm for numbering the elements of sign-alternating groups,” Kibernetika, No. 1 (1974).
J. Riordan, An Introduction to Combinatiorial Analysis, Wiley, New York (1958).
Additional information
Translated from Kibernetika, No. 3, pp. 44–47, May–June, 1976.
Rights and permissions
About this article
Cite this article
Zlotnik, B.M. Algorithm for numbering the partitions of n into m parts. Cybern Syst Anal 12, 377–381 (1976). https://doi.org/10.1007/BF01070017
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01070017