Theory of Summation in Finite Terms
Journal of Symbolic Computation
The method of creative telescoping
Journal of Symbolic Computation
D'Alembertian solutions of linear differential and difference equations
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Greatest factorial factorization and symbolic summation
Journal of Symbolic Computation
Solving difference equations in finite terms
Journal of Symbolic Computation
Journal of the ACM (JACM)
Multibasic and mixed hypergeometric Gosper-type algorithms
Journal of Symbolic Computation - Special issue on differential algebra and differential equations
On solutions of linear ordinary difference equations in their coefficient field
Journal of Symbolic Computation
An extension of Zeilberger's fast algorithm to general holonomic functions
Discrete Mathematics
Symbolic summation with single-nested sum extensions
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Finding telescopers with minimal depth for indefinite nested sum and product expressions
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Application of unspecified sequences in symbolic summation
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Symbolic summation with radical expressions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Summation in finite terms using sage
ACM Communications in Computer Algebra
A symbolic summation approach to Feynman integral calculus
Journal of Symbolic Computation
Automated simplification of large symbolic expressions
Journal of Symbolic Computation
Hi-index | 0.00 |
In this article we present a refined summation theory based on Karr's difference field approach. The resulting algorithms find sum representations with optimal nested depth. For instance, the algorithms have been applied successively to evaluate Feynman integrals from Perturbative Quantum Field Theory.