A Set of Identities for a Class of Alternating Binomial Sums Arising in Computing Applications

Abstract

We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to subsume several previously known cases. Extensions of the method are apparent and are outlined.

13 pages, no figures, to appear in Util. Math. (2007)

Cited by in corpus (8)

• Some series and integrals involving the Riemann zeta function, binomial coefficients and the harmonic numbers. Volume I
• The difference between two Stieltjes constants
• Various applications of the (exponential) complete Bell polynomials
• Euler-Hurwitz series and non-linear Euler sums
• On the coefficients of the Baez-Duarte criterion for the Riemann hypothesis and their extensions
• A recurrence relation for the Li/Keiper constants in terms of the Stieltjes constants
• Complete and incomplete Bell polynomials associated with Lah-Bell numbers and polynomials
• On the generalized Bernoulli numbers