REVIEW 3 cited by
Decomposition of Feynman Integrals by Multivariate Intersection Numbers
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
read the original abstract
We present a detailed description of the recent idea for a direct decomposition of Feynman integrals onto a basis of master integrals by projections, as well as a direct derivation of the differential equations satisfied by the master integrals, employing multivariate intersection numbers. We discuss a recursive algorithm for the computation of multivariate intersection numbers and provide three different approaches for a direct decomposition of Feynman integrals, which we dub the straight decomposition, the bottom-up decomposition, and the top-down decomposition. These algorithms exploit the unitarity structure of Feynman integrals by computing intersection numbers supported on cuts, in various orders, thus showing the synthesis of the intersection-theory concepts with unitarity-based methods and integrand decomposition. We perform explicit computations to exemplify all of these approaches applied to Feynman integrals, paving a way towards potential applications to generic multi-loop integrals.
Forward citations
Cited by 3 Pith papers
-
Tame multi-leg Feynman integrals beyond one loop
A 'branch' reformulation of Feynman integrals claims to reduce multi-loop integrals to one-loop-like low-dimensional integrals, but the advertised parameter bound is wrong and the numerical validation is not shown.
-
Kira 3: integral reduction with efficient seeding and optimized equation selection
Kira 3 cuts Feynman-integral reduction cost by up to two orders of magnitude using smarter seeding and equation selection.
-
Direct Expression for One-Loop Tensor Reduction with Lorentz Indices via Generating Function
A rational, recursion-free expression for one-loop tensor reduction coefficients with Lorentz indices is given, built from a small set of tensor building blocks.
Discussion (0). Continue with ORCID to comment.