A new generating-function framework turns IBP relations into differential equations in a non-commutative algebra, yielding an iterative algorithm that derives symbolic reduction rules and checks completeness for topologies such as the sunset and double-box diagrams.
Refining integration-by-parts reduction of feynman integrals with machine learning
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
years
2026 3roles
background 2polarities
background 2representative citing papers
Inconsistency in spanning cuts for IBP reductions arises because cuts can make hidden terms in IBP relations finite via pinch singularities that cancel vanishing parameters, linked to hidden linear relations between propagators, for which an algorithm is provided.
citing papers explorer
-
An Algorithm for the Symbolic Reduction of Multi-loop Feynman Integrals via Generating Functions
A new generating-function framework turns IBP relations into differential equations in a non-commutative algebra, yielding an iterative algorithm that derives symbolic reduction rules and checks completeness for topologies such as the sunset and double-box diagrams.
-
On the spanning cuts consistency problem in the IBP reductions of Feynman integrals
Inconsistency in spanning cuts for IBP reductions arises because cuts can make hidden terms in IBP relations finite via pinch singularities that cancel vanishing parameters, linked to hidden linear relations between propagators, for which an algorithm is provided.