pith. machine review for the scientific record.
sign in

arxiv: 1712.04441 · v3 · pith:6BZUSA36new · submitted 2017-12-12 · ✦ hep-ph

All orders structure and efficient computation of linearly reducible elliptic Feynman integrals

classification ✦ hep-ph
keywords integralsdimensionaltermsellipticemplsfeynmanintegraldifferential
0
0 comments X
read the original abstract

We define linearly reducible elliptic Feynman integrals, and we show that they can be algorithmically solved up to arbitrary order of the dimensional regulator in terms of a 1-dimensional integral over a polylogarithmic integrand, which we call the inner polylogarithmic part (IPP). The solution is obtained by direct integration of the Feynman parametric representation. When the IPP depends on one elliptic curve (and no other algebraic functions), this class of Feynman integrals can be algorithmically solved in terms of elliptic multiple polylogarithms (eMPLs) by using integration by parts identities. We then elaborate on the differential equations method. Specifically, we show that the IPP can be mapped to a generalized integral topology satisfying a set of differential equations in $\epsilon$-form. In the examples we consider the canonical differential equations can be directly solved in terms of eMPLs up to arbitrary order of the dimensional regulator. The remaining 1-dimensional integral may be performed to express such integrals completely in terms of eMPLs. We apply these methods to solve two- and three-points integrals in terms of eMPLs. We analytically continue these integrals to the physical region by using their 1-dimensional integral representation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Integral Reduction with Kira 2.0 and Finite Field Methods

    hep-ph 2020-08 conditional novelty 7.0

    Kira 2.0 implements finite-field coefficient reconstruction for IBP reductions and improved user-equation handling, yielding lower memory use and faster performance on state-of-the-art problems.