Simplifying multiple sums in difference fields. In this survey article, we present difference field algorithms for symbolic summation. Special emphasize is put on new aspects in how the summation problems are rephrased in terms of difference fields, how the problems are solved there, and how the derived results in the given difference field can be reinterpreted as solutions of the input problem. The algorithms are illustrated with the Mathematica package Sigma by discovering and proving new harmonic number identities extending those from Paule and Schneider, 2003. In addition, the newly developed package EvaluateMultiSums is introduced that combines the presented tools. In this way, large scale summation problems for the evaluation of Feynman diagrams in QCD (Quantum ChromoDynamics) can be solved completely automatically.
Keywords for this software
References in zbMATH (referenced in 6 articles , 1 standard article )
Showing results 1 to 6 of 6.
- Schneider, Carsten; Sulzgruber, Robin: Asymptotic and exact results on the complexity of the Novelli-Pak-Stoyanovskii algorithm (2017)
- Ablinger, J.; Behring, A.; Blümlein, J.; De Freitas, A.; von Manteuffel, A.; Schneider, C.: Calculating three loop ladder and $V$-topologies for massive operator matrix elements by computer algebra (2016)
- Schneider, Carsten: A difference ring theory for symbolic summation (2016)
- Kauers, Manuel; Yen, Lily: On the length of integers in telescopers for proper hypergeometric terms (2015)
- Ablinger, J.; Blümlein, J.; Raab, C.G.; Schneider, C.: Iterated binomial sums and their associated iterated integrals (2014)
- Schneider, Carsten: Simplifying multiple sums in difference fields (2013)