REVIEW 3 cited by
Intersection Numbers, Polynomial Division and Relative Cohomology
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
abstract
We present a simplification of the recursive algorithm for the evaluation of intersection numbers for differential $n$-forms, by combining the advantages emerging from the choice of delta-forms as generators of relative twisted cohomology groups and the polynomial division technique, recently proposed in the literature. We show that delta-forms capture the leading behaviour of the intersection numbers in presence of evanescent analytic regulators, whose use is, therefore, bypassed. This simplified algorithm is applied to derive the complete decomposition of two-loop planar and non-planar Feynman integrals in terms of a master integral basis. More generally, it can be applied to derive relations among twisted period integrals, relevant for physics and mathematical studies.
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.
-
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.
Discussion (0). Continue with ORCID to comment.