Multiple binomial sums - Archive ouverte HAL Access content directly
Journal Articles Journal of Symbolic Computation Year : 2017

Multiple binomial sums

Pierre Lairez
Bruno Salvy

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.
Fichier principal
Vignette du fichier
binomsums.pdf (699.83 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01220573 , version 1 (26-10-2015)
hal-01220573 , version 2 (15-06-2016)

Identifiers

Cite

Alin Bostan, Pierre Lairez, Bruno Salvy. Multiple binomial sums. Journal of Symbolic Computation, 2017, 80 (2), pp.351--386. ⟨10.1016/j.jsc.2016.04.002⟩. ⟨hal-01220573v2⟩
554 View
4333 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More