Pith. sign in

REVIEW 1 cited by

Recursive computation of Feynman periods

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2206.10460 v2 pith:75V4BHEE submitted 2022-06-21 hep-th math-phmath.MP

classification hep-thmath-phmath.MP
keywords feynmanperiodstheorycomputationfieldfunctionsintegralsloops
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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 $\phi^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 $\phi^3$ and $\phi^4$ theory share the same number content.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Graph theoretic properties of Speyer's matroid polynomial $g_M(t)$

    math.CO 2025-06 accept novelty 7.0 of 10

    For graphic and cographic matroids, the derivative g'_M(-1) equals (-1)^{c(M)-1} c(M), and computational data suggests many new properties of the coefficient N2.

Pith tools