Extremal properties of sums of binomial coefficients

MaRDI QIDQ2759371zbMATH OpenFDO

Authors N. N. Kanaeva, Oleg A. Shcherbina

Publication date 12 December 2001

Published in Dinamicheskie Sistemy (Simferopol') (Search for Journal in Brave)

zbMATH Keywords

algorithmsbinomial coefficientsdiscrete optimizationextremal propertiesmajorization theory

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Review text

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.

Recommendations

• Partial sums of binomial coefficients
• Identities and inequalities for sums involving binomial coefficients
• Convexity of finite sums
• scientific article; zbMATH DE number 4139750
• On Coefficients of Binary Expression of Integer Sums

Cited in

(3)

• On the maximum of the weighted binomial sum \(2^{-r}\sum_{i=0}^r\binom{m}{i}\)
• An Optimization Problem Involving Binomial Coefficients
• Convexity Properties of Reciprocals of Binomial Coefficients

This page was built for publication: Extremal properties of sums of binomial coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2759371)