FoCM 2014 conference

Workshop B7 - Symbolic Analysis - Semi-plenary talk

December 17, 14:35 ~ 15:25 - Room A11

Multiple binomial sums

Bruno Salvy

INRIA, France   -

Multiple binomial sums form a very rich class with a lot of structure, which makes it possible to design specific algorithms that prove or discover closed forms or recurrences. In particular, these sums can be expressed as diagonals of rational functions and recurrences can then be obtained by computing a linear differential equation satisfied by the integral of a rational function. We discuss the complexity aspects of this approach as well as its practical use, and compare it to variants of Zeilberger's algorithm.

Joint work with Alin Bostan (Inria, France) and Pierre Lairez (Inria, France).

View abstract PDF