This article is cited in 2 scientific papers (total in 2 papers)
Computational Methods in Discrete Mathematics
A formula for the number of combinations with constrained repetitions and its application
V. V. Gotsulenko
Institute for Technical Thermal Physics, National Academy of Sciences of Ukraine, Kiev, Ukraine
Various generalizations of the concept of combination with repetitions are obtained. Formulas for the calculation of the considered combinatorial numbers are found, and various problems that are solved with their application are considered.
combinations with constrained repetitions, Diophantine equations, formal polynomial, generating functions, multisets.
PDF file (519 kB)
V. V. Gotsulenko, “A formula for the number of combinations with constrained repetitions and its application”, Prikl. Diskr. Mat., 2013, no. 2(20), 71–77
Citation in format AMSBIB
\paper A formula for the number of combinations with constrained repetitions and its application
\jour Prikl. Diskr. Mat.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
V. V. Gotsulenko, “Kombinatornye chisla dlya podscheta razbienii konechnykh multimnozhestv”, PDM, 2013, no. 4(22), 67–72
V. V. Gotsulenko, “Formalizatsiya kombinatornykh chisel v terminakh tselochislennykh reshenii sistem lineinykh diofantovykh uravnenii”, PDM. Prilozhenie, 2014, no. 7, 157–160
|Number of views:|