vix.ing · top · new · best · stats · spec

Multiple polylogarithms and linearly reducible Feynman graphs

2013/02/25 by Christian Bogner, Bogner, Christian, Martin Lüders +1 · 2 citations
Mathematics · Physics and Astronomy · #Advanced Algebra and Geometry #Advanced Mathematical Identities #Analytic Number Theory Research #FOS: Physical sciences #High Energy Physics - Phenomenology (hep-ph) #High Energy Physics - Theory (hep-th) #hep-ph #hep-th

paper · pdf · doi:10.48550/arxiv.1302.6215

17 pages, to appear in the proceedings of the workshop "Periods and Motives", Madrid, July 2012

arxiv created 2013/02/25 · openalex publication_date 2013/02/25 · arxiv updated 2013/02/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

Cited by

Related