REVIEW 6 cited by
How to choose master integrals
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
How to choose master integrals
read the original abstract
The standard procedure when evaluating integrals of a given family of Feynman integrals, corresponding to some Feynman graph, is to construct an algorithm which provides the possibility to write any particular integral as a linear combination of so-called master integrals. To do this, public (AIR, FIRE, REDUZE, LiteRed, KIRA) and private codes based on solving integration by parts relations are used. However, the choice of the master integrals provided by these codes is not always optimal. We present an algorithm to improve a given basis of the master integrals, as well as its computer implementation; see also a competitive variant [1].
Forward citations
Cited by 6 Pith papers
-
The four-loop non-singlet splitting functions in QCD
Four-loop non-singlet splitting functions in QCD are computed analytically for the first time, with numerical representations provided.
-
The photon-energy spectrum in $B\to X_s\gamma$ to N$^3$LO: light-fermion and large-$N_{\rm c}$ corrections
N3LO calculation of the B to Xs gamma photon spectrum including complete light-fermion corrections, two massive fermion loops, and large-Nc terms, with improved results in kinetic and MSR mass schemes.
-
Taming Symbolic IBP Reduction with Intermediate Bases
An algorithm reconstructs symbolic IBP reduction coefficients via intermediate bases, demonstrated on massive box-triangle and pentagon-triangle integrals using 3289 and 13013 samplings versus over a million unknowns.
-
Integral Reduction with Kira 2.0 and Finite Field Methods
Kira 2.0 implements finite-field coefficient reconstruction for IBP reductions and improved user-equation handling, yielding lower memory use and faster performance on state-of-the-art problems.
-
AMFlow 2.0: significant algorithmic and software improvements for Feynman integral evaluation
AMFlow 2.0 cuts symbolic and numerical cost of multi-loop Feynman integral evaluation via an FT recursion mode, a C++ DE solver, and modern IBP reducers, demonstrated on a three-loop five-point family.
-
From geometry to phenomenology
Feynman integrals with mixed geometries (K3 surfaces, curves, points) can be computed more efficiently by extracting and using their algebraic geometric properties.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.