Multiple binomial sums. (May 2017)

• Record Type: Journal Article
• Authors: Bostan, Alin; Lairez, Pierre; Salvy, Bruno
• Is Part Of: Journal of symbolic computation. Volume 80:Part 2(2017)
• Page Start: 351
• Page End: 386
• Publication Date: 2017-05
• Subjects: 05A10 -- 33F10 -- 68W30; Binomial sum -- Multiple sum -- Symbolic computation -- Diagonal -- Integral representation; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Data processing -- Periodicals; Automatic programming (Computer science) -- Periodicals; Mathématiques -- Informatique -- Périodiques; Analyse numérique -- Informatique -- Périodiques; Programmation automatique -- Périodiques; Automatic programming (Computer science); Mathematics -- Data processing; Numerical analysis -- Data processing; Periodicals; Electronic journals; 510.285
• DOI: 10.1016/j.jsc.2016.04.002
• Languages: English
• ISSNs: 0747-7171

Abstract

Abstract: Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with algebraic generating function. We study the representation of the generating functions of binomial sums by integrals of rational functions. The outcome is twofold. Firstly, we show that a univariate sequence is a multiple binomial sum if and only if its generating function is the diagonal of a rational function. Secondly, we propose algorithms that decide the equality of multiple binomial sums and that compute recurrence relations for them. In conjunction with geometric simplifications of the integral representations, this approach behaves well in practice. The process avoids the computation of certificates and the problem of the appearance of spurious singularities that afflicts discrete creative telescoping, both in theory and in practice.