Formalization of combinatorial numbers in terms of entire solutions of systems of linear Diophantine 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.