RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive

Prikl. Diskr. Mat., 2013 Number 2(20), Pages 71–77 (Mi pdm409)

This article is cited 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.

UDC: 519.1



© Steklov Math. Inst. of RAS, 2025