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.