Recursive computation of Feynman periods

DOI10.1007/JHEP08(2022)291MaRDI QIDQ6402743arXivFDO

Authors Michael Borinsky, Oliver Schnetz

Publication date 21 June 2022

Published in arXiv

Full work available at URL https://doi.org/10.1007/JHEP08(2022)291

Mathematics Subject Classification ID

Feynman integrals and graphs; applications of algebraic topology and algebraic geometry (81Q30) Path integrals in quantum mechanics (81S40) Model quantum field theories (81T10) Perturbative methods of renormalization applied to problems in quantum field theory (81T15) Feynman diagrams (81T18)

arXiv classification

hep-thmath-phmath.MP

Abstract: Feynman periods are Feynman integrals that do not depend on external kinematics. Their computation, which is necessary for many applications of quantum field theory, is greatly facilitated by graphical functions or the equivalent conformal four-point integrals. We describe a set of transformation rules that act on such functions and allow their recursive computation in arbitrary even dimensions. As a concrete example we compute all subdivergence-free Feynman periods in $ph{i}^3$ theory up to six loops and 561 of 607 Feynman periods at seven loops. Our results support the conjectured existence of a coaction structure in quantum field theory and suggest that $ph{i}^3$ and $ph{i}^4$ theory share the same number content.

This page was built for publication: Recursive computation of Feynman periods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6402743)