Nested (inverse) binomial sums and new iterated integrals for massive Feynman diagrams

Abstract

Nested sums containing binomial coefficients occur in the computation of massive operator matrix elements. Their associated iterated integrals lead to alphabets including radicals, for which we determined a suitable basis. We discuss algorithms for converting between sum and integral representations, mainly relying on the Mellin transform. To aid the conversion we worked out dedicated rewrite rules, based on which also some general patterns emerging in the process can be obtained.

13 pages LATEX, one style file, Proceedings of Loops and Legs in Quantum Field Theory -- LL2014,27 April 2014 -- 02 May 2014 Weimar, Germany

References in corpus (7)

• A Computer Algebra Toolbox for Harmonic Sums Related to Particle Physics
• A Refined Difference Field Theory for Symbolic Summation
• A Fast Approach to Creative Telescoping
• Modern Summation Methods and the Computation of 2- and 3-loop Feynman Diagrams
• A Symbolic Summation Approach to Find Optimal Nested Sum Representations
• Evaluation of Multi-Sums for Large Scale Problems
• Hermite Reduction and Creative Telescoping for Hyperexponential Functions