1 code implementation • 26 Oct 2015 • Alin Bostan, Pierre Lairez, Bruno Salvy
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.
Symbolic Computation Combinatorics 05A10, 33F10, 68W30
1 code implementation • 21 Jan 2013 • Alin Bostan, Shaoshi Chen, Frédéric Chyzak, Ziming Li, Guoce Xin
Based on this reduction algorithm, we design a new method to compute minimal telescopers for bivariate hyperexponential functions.
Symbolic Computation Combinatorics 33F10
