A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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.doi:10.1090/conm/648/12996 fatcat:h4e7c64mebeydp2bpimpxpltaq