Formalization of combinatorial numbers in terms of entire solutions of systems of linear diophan-tine equations | Applied Discrete Mathematics. Supplement. 2014. № 7.

HomeIssuesFormalization of combinatorial numbers in terms of entire solutions of systems of linear diophan-tine equations | Applied Discrete Mathematics. Supplement. 2014. № 7.

Formalization of combinatorial numbers in terms of entire solutions of systems of linear diophan-tine equations

Some generalizations of the number of placements with repetitions and various restrictions are considered. Counting these combinatorial numbers leads to the definition of nonnegative solutions of systems of linear Diophantine equations under appropriate additional restrictions. Generating functions and integral formulas for calculating input combinatorial numbers are obtained, and various problems that are solved with their application are discussed.

Download file
Counter downloads: 302

Keywords

combinatorial numbers, systems of linear Diophantine equations, generating functions, комбинаторные числа, системы линейных диофантовых уравнений, производящие функции

Authors

NameOrganizationE-mail
Gotsulenko V. V.gosul@ukr.net
Всего: 1

References

Яблонский С. В. Введение в дискретную математику. М.: Наука, 1986. 384 с.
Гоцуленко В. В. Формула для числа сочетаний с повторениями при ограничениях и её применение // Прикладная дискретная математика. 2013. №2(20). С. 71-77.
Formalization of combinatorial numbers in terms of entire solutions of systems of linear diophan-tine equations | Applied Discrete Mathematics. Supplement. 2014. № 7.

Formalization of combinatorial numbers in terms of entire solutions of systems of linear diophan-tine equations | Applied Discrete Mathematics. Supplement. 2014. № 7.