Multiple polylogarithms and linearly reducible Feynman graphs
arXiv:1302.6215
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.
arXiv comment17 pages, to appear in the proceedings of the workshop "Periods and Motives", Madrid, July 2012
References in corpus (17)
- Harmonic Polylogarithms
- Differential Equations for Feynman Graph Amplitudes
- An automatized algorithm to compute infrared divergent multi-loop integrals
- Connection between Feynman integrals having different values of the space-time dimension
- Multiple polylogarithms and mixed Tate motives
- HypExp, a Mathematica package for expanding hypergeometric functions around integer-valued parameters
- Analytic treatment of the two loop equal mass sunrise graph
- The Two-Loop Hexagon Wilson Loop in N = 4 SYM
- Space-time dimensionality D as complex variable: calculating loop integrals using dimensional recurrence relation and analytical properties with respect to D
- Soft triple-real radiation for Higgs production at N3LO
- Analytical and numerical methods for massive two-loop self-energy diagrams
- Feynman graph polynomials
- On the periods of some Feynman integrals
- Three-mass triangle integrals and single-valued polylogarithms
- The massless two-loop two-point function
- Massive 3-loop Ladder Diagrams for Quarkonic Local Operator Matrix Elements
- Angles, scales and parametric renormalization