Multiple polylogarithms and linearly reducible Feynman graphs
From MaRDI portal
Abstract: We review an approach for the computation of Feynman integrals by use of multiple polylogarithms, with an emphasis on the related criterion of linear reducibility of the graph. We show that the set of graphs which satisfies the linear reducibility with respect to both Symanzik polynomials is closed under taking minors. As a step towards a classification of Feynman integrals, we discuss the concept of critical minors and exhibit an example at three loops with four on-shell legs.
Recommendations
Cited in
(12)- Algebraic reduction of one-loop Feynman graph amplitudes
- MPL -- a program for computations with iterated integrals on moduli spaces of curves of genus zero
- Rationalizing loop integration
- On one-dimensional digamma and polygamma series related to the evaluation of Feynman diagrams
- Graph minors and the linear reducibility of Feynman diagrams
- Feynman graph polynomials
- Feynman integrals and multiple polylogarithms
- A practical criterion of irreducibility of multi-loop Feynman integrals
- Feynman graphs
- The number of master integrals is finite
- The massless higher-loop two-point function
- Critical points and number of master integrals
This page was built for publication: Multiple polylogarithms and linearly reducible Feynman graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3187346)
