Algorithms for the symbolic integration of hyperlogarithms with applications to Feynman integrals
Erik Panzer
TL;DR
The work tackles the symbolic integration of hyperlogarithms multiplied by rational functions, a key step for evaluating Feynman graphs and their ε-expansions. It develops a concrete framework based on iterated integrals and shuffle algebra to construct primitives and regularize divergences, enabling exact symbolic results for linearly reducible multi-dimensional integrals. A central contribution is the complete Maple-based implementation HyperInt, including a robust regularization workflow and a polynomial-reduction strategy that leverages linear reducibility to control the complexity. The approach is validated through extensive tests and applications to Feynman integrals, with results expressed in terms of multiple zeta values and related periods, highlighting both the mathematical structure and practical impact for high-precision quantum-field-theory calculations.
Abstract
We provide algorithms for symbolic integration of hyperlogarithms multiplied by rational functions, which also include multiple polylogarithms when their arguments are rational functions. These algorithms are implemented in Maple and we discuss various applications. In particular, many Feynman integrals can be computed by this method.
