Geodesic
A formula for the number of combinations with constrained repetitions and its application
Prikladnaâ diskretnaâ matematika, no. 2 (2013), pp. 71-77

Voir la notice de l'article provenant de la source Math-Net.Ru

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, generating functions, multisets.
Mots-clés : Diophantine equations, formal polynomial 
@article{PDM_2013_2_a7,
     author = {V. V. Gotsulenko},
     title = {A formula for the number of combinations with constrained repetitions and its application},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {71--77},
     publisher = {mathdoc},
     number = {2},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2013_2_a7/}
}
TY  - JOUR
AU  - V. V. Gotsulenko
TI  - A formula for the number of combinations with constrained repetitions and its application
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2013
SP  - 71
EP  - 77
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2013_2_a7/
LA  - ru
ID  - PDM_2013_2_a7
ER  - 
%0 Journal Article
%A V. V. Gotsulenko
%T A formula for the number of combinations with constrained repetitions and its application
%J Prikladnaâ diskretnaâ matematika
%D 2013
%P 71-77
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2013_2_a7/
%G ru
%F PDM_2013_2_a7
V. V. Gotsulenko. A formula for the number of combinations with constrained repetitions and its application. Prikladnaâ diskretnaâ matematika, no. 2 (2013), pp. 71-77. http://geodesic.mathdoc.fr/item/PDM_2013_2_a7/