The method of creative telescoping
Journal of Symbolic Computation
Fast polynomial dispersion computation and its application to indefinite summation
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Indefinite sums of rational functions
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Greatest factorial factorization and symbolic summation
Journal of Symbolic Computation
Rational summation and Gosper-Petkovsˇek
Journal of Symbolic Computation - Special issue on symbolic computation in combinatorics
Hi-index | 0.00 |
We propose a strategy for simplification of definite sums of rational functions which, for a given input rational function F(n, k), constructs two rational functions G(n) and T(n, k) such that∑k=0nF(n, k) = G(n) + ∑k=0nT(n, k),where the degree of the denominator w.r.t. k of T(n, k) is "small". The strategy is based on well-known algorithms which solve the indefinite sum of rational functions and on the creative symmetrizing method. It provides a tool for finding closed forms for some instances of definite sums of rational functions where Zeilberger's creative telescoping method is not applicable.