Extremal properties of sums of binomial coefficients
Some extremal problems for sums of binomial coefficients that arise in investigations to estimate the computational complexity of discrete optimization algorithms are considered. These extremal problems are solved using the method of majorization. The coefficient inequalities for the sums of binomial coefficients are presented.
scientific article; zbMATH DE number 1681781