|
Prikladnaya Diskretnaya Matematika, 2013, Number 2(20), Pages 71–77
(Mi pdm409)
|
|
|
|
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
Abstract:
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.
Keywords:
combinations with constrained repetitions, Diophantine equations, formal polynomial, generating functions, multisets.
Citation:
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
Linking options:
https://www.mathnet.ru/eng/pdm409 https://www.mathnet.ru/eng/pdm/y2013/i2/p71
|
Statistics & downloads: |
Abstract page: | 739 | Full-text PDF : | 752 | References: | 50 |
|