Untangling the IBP Equations

TL;DR

This paper introduces an algorithm for diagonalizing IBP equations, enabling more efficient reduction of complex loop integrals and facilitating analytic solutions in multivariate Mellin representations.

Contribution

The paper presents a novel algorithm for diagonalizing IBP equations, improving computational efficiency and extending applicability to multivariate recurrence relations.

Findings

Successfully diagonalized complex IBP topologies

Produced closed-form solutions for loop integrals

Enhanced computational efficiency for integral reduction

Abstract

In this work, we present an algorithm for the diagonalization of the Integration-by-Parts (IBP) equations. Diagonalized IBP equations are indispensable for reducing loop integrals with high numerator powers to master integrals and for solving IBP identities in closed analytic form. A prime example is provided by multivariate Mellin representations of loop amplitudes and cross sections. The extension of these methods to other multivariate recurrence relations is also discussed. As a by-product of our diagonalization procedure, we show how the IBP equations can be cast into an efficient, fully triangular form that is well suited for computer implementation. Several complicated topologies have been computed.