Recursive computation of Feynman periods

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 φ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 φ3 and φ4 theory share the same number content.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…