Theory of Summation in Finite Terms
Journal of Symbolic Computation
A fast algorithm for proving terminating hypergeometric identities
Discrete Mathematics
D'Alembertian solutions of linear differential and difference equations
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Solving difference equations in finite terms
Journal of Symbolic Computation
Journal of the ACM (JACM)
On solutions of linear ordinary difference equations in their coefficient field
Journal of Symbolic Computation
Finding telescopers with minimal depth for indefinite nested sum and product expressions
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
A refined difference field theory for symbolic summation
Journal of Symbolic Computation
Symbolic loop bound computation for WCET analysis
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Hi-index | 0.00 |
We present a streamlined and refined version of Karr's summation algorithm. Karr's original approach constructively decides the telescoping problem in ΠΣ-fields, a very general class of difference fields that can describe rational terms of arbitrarily nested indefinite sums and products. More generally, our new algorithm can decide constructively if there exists a so called single-nested ΠΣ-extension over a given ΠΣ-field in which the telescoping problem for f can be solved in terms that are not more nested than f itself. This allows to eliminate an indefinite sum over f by expressing it in terms of additional sums that are not more nested than f. Moreover, our refined algorithm contributes to definite summation: it can decide constructively if the creative telescoping problem for a fixed order can be solved in single-nested Σ*-extensions that are less nested than the definite sum itself.