REVIEW 4 cited by
Reduction to master integrals via intersection numbers and polynomial expansions
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
Signed reviews
read the original abstract
Intersection numbers are rational scalar products among functions that admit suitable integral representations, such as Feynman integrals. Using these scalar products, the decomposition of Feynman integrals into a basis of linearly independent master integrals is reduced to a projection. We present a new method for computing intersection numbers that only uses rational operations and does not require any integral transformation or change of basis. We achieve this by systematically employing the polynomial series expansion, namely the expansion of functions in powers of a polynomial. We also introduce a new prescription for choosing dual integrals, de facto removing the explicit dependence on additional analytic regulators in the computation of intersection numbers. We describe a proof-of-concept implementation of the algorithm over finite fields and its application to the decomposition of Feynman integrals at one and two loops.
Forward citations
Cited by 4 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.
-
Intersection matrices associated to geometric-ordered bases of Feynman integrals
Intersection matrices of geometric-ordered Feynman integral bases are Laurent polynomials or, after a power-of-epsilon factor, integers, which enables systematic elimination of redundant auxiliary functions on the max...
-
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.
-
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.
Discussion (0). Continue with ORCID to comment.