Untangling the Integration-By-Parts Equations

arXiv:2512.05923 · hep-ph, hep-th · Submitted 2025-12-05 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: High Energy Physics: Phenomenology. The day in particle phenomenology: models, signatures and constraints.

Kai: We're looking at the paper: "Untangling the Integration-By-Parts Equations".

Paper summary: Kai: So, we're looking at this paper called Untangling the Integration-By-Parts Equations. The main thing here is an algorithm for diagonalizing these IBP equations. This diagonalization is really key because it helps reduce loop integrals with high powers in the numerator down to master integrals, and it lets you solve those identities in a closed analytic form.

Mira: Exactly, and this was astonishing because for forty years, these IBP identities have been the centerpiece of multi-loop calculations, but we still don't have a general analytic solution for them. The authors are proposing a systematic way to diagonalize them, which is the first time such a result has actually been achieved.

Lev: And they show three different ways to write these equations: diagonal form, matrix-diagonal form, and triangular form. They use the one-loop box topology as a simple example of how this works.

Kai: The diagonal form involves getting a set of recurrence relations where each relation shifts just one index at a time while keeping everything else fixed, and the number of relations equals the number of master integrals in that specific topology.

Mira: Then there's the matrix-diagonal form, which turns those diagonal equations into a system with vectors and matrices mapping any integral directly to master integrals without leaving any dependent integrals unsolved.

Lev: And they also introduce a triangular form, which is proposed as an efficient way characterized by strictly triangular equations that you can actually implement in existing IBP-solving programs without needing back-substitutions.

Kai: The authors focus on the triangular algorithm because it seems to be quite efficient for computer implementation. They describe deriving a small system of equations involving integrals with abstract indices and then using specific integer values for those indices to get the explicit system.

Mira: They use simplicity criteria based on a weight w, which is like the negative sum of non-positive indices, and an ordering parameter called delta I a I b to order integrals within a sector. This process maps any integral in a given sector to simpler integrals in that same sector or sub-sectors, ensuring the resulting equations are of second order for certain sectors.

Lev: The efficiency claim comes from showing that this triangular approach significantly outperforms syzygy-based algorithms when solving complex topologies like B one. They also mention that the triangular approach avoids squared propagators at the intermediate stages, which is a big win for stability.

Kai: So, those diagonal equations, especially in the matrix formulation, are indispensable when you have integrals with high numerator powers or when those powers are treated as abstract variables because they make it possible to get solutions in closed analytic form.

Paper summary: Mira: And the authors show that this technology is not just for Feynman integrals; they've applied these diagonalization ideas to things like the contiguous relations of the Gauss hypergeometric function.

Lev: They even showed how this technique can be used to derive a Fibonacci recurrence in matrix form and diagonalize it using a similarity transformation that leads to decoupled first-order recurrence relations.

Kai: And when we look at benchmarking, they tested this triangular algorithm on three two-loop topologies, including the non-planar amplitude for off-shell di-boson production, the planar topology C one, and the most complicated non-planar topology B one.

Mira: The results are pretty compelling: for off-shell di-boson C one, the triangular method was about six times faster than syzygy solutions in terms of total time. Plus, their timings using the Fermat library for the triangular approach were between fifty percent and a factor of fifteen faster than finite field calculations.

Lev: What's interesting is that for off-shell di-boson C one, the triangular method spent about ninety three percent of its time on just evaluating rational coefficients and only about six percent on actually solving the IBP equations. That suggests the structure of these equations really helps speed things up in practice.

Kai: So, to summarize what they did: they showed how to diagonalize IBP equations, proposed a new triangular algorithm that produces strictly triangular form with no back-substitutions and no squared propagators, and used this to solve identities for different topologies.

Mira: The implication here is that we can get closed analytic solutions for these identities, which could give us deeper insight into the analytic structures underpinning the set of loop integrals. This work is titled Untangling the Integration-By-Parts Equations.

Lev: It also suggests that this diagonalization method, particularly the matrix formulation, is crucial for reducing integrals with high numerator powers or when those powers are treated as abstract variables.

Kai: And because they can get solutions in closed analytic form, it opens up possibilities for applications like multivariate Mellin representations of gauge theory amplitudes and cross sections.

Mira: The paper shows how this method works on other multivariate recurrence relations too, which expands the scope beyond just Feynman integrals to other types of systems.

Lev: The authors note that their method is at least comparable to existing state-of-the-art approaches and they show strong potential for further speed-up improvements based on the ordering criteria they established.

Kai: So, in conclusion, this work provides a new algorithm called triangular that produces strictly triangular equations, which are efficient because they don't require back-substitutions and don't lead to squared propagators. The diagonal equations in the matrix formulation are indispensable for reducing integrals with high numerator powers or when those powers are treated as abstract variables.

Paper summary: Mira: And this approach makes it possible to derive solutions to the IBP identities in closed analytic form, which may offer deeper insight into the analytic structures underpinning the set of loop integrals. The authors have also successfully applied this technology to seemingly unrelated objects, such as the contiguous relations of the Gauss hypergeometric function.

Lev: They’ve also shown that they can map every integral directly to a set of master integrals using their matrix diagonal formulation, though they admit that their seemingly equivalent diagonal formulation leads to a wider set of integrals that still needs reduction.

Kai: So, this paper, Untangling the Integration-By-Parts Equations, gives us this diagonalization algorithm and the triangular form equations which are fast because they avoid back-substitutions and squared propagators. The diagonal equations help us reduce integrals with high powers or abstract variables for closed analytic solutions.

Mira: And these results suggest that we can get deeper insight into the analytic structures of loop integrals by finding closed analytic solutions to the IBP identities. It’s a new way to look at this problem and they've extended it to other multivariate recurrence relations too.

Lev: For real hardware, running something like this would depend on how fast you can compute those rational coefficients, which the benchmark results suggest is already quite good. The paper notes that the triangular equations are very efficient in solving IBP equations.

Kai: That's what we were hoping to hear—that they don't just find a way to solve it, but they find a way to solve it efficiently enough for real computational needs.

Mira: And the application to gauge theory amplitudes is interesting because it suggests that these analytic structures might be useful in representing physical observables in new ways.

Lev: We have to remember the limitation mentioned: they are focused on the diagonalization of IBP equations, and while they show efficiency gains over syzygies, their method doesn't solve every single IBP identity automatically without further constraints.

Kai: So that’s the current status: a fast algorithm to get a triangular form for these equations that helps us find closed analytic solutions for loop integrals.

Mira: And it points toward using multivariate Mellin representations in gauge theory amplitudes, which is where we can potentially represent things in a new, structured way.

Lev: We see the potential for this structure being useful, but we still need to figure out how to translate these abstract index orderings into actual constraints you can apply on real hardware.

Conclusion: Kai: So we’re wrapping up on Untangling the Integration-By-Parts Equations and where all that work ends up for us, Mira.

Mira: Yeah, we’ve been looking at how this new way to diagonalize those integration by parts equations works and what it actually means for our theoretical framework.

Kai: Basically, they’ve developed this algorithm called the triangular approach which creates strictly triangular equations without needing those messy back-substitutions we usually have to deal with.

Mira: That’s right, and the authors are showing that this process can lead to a closed analytic form for these identities, which is pretty significant because we usually only get limited results.

Kai: It means they’ve found a structured way to solve those complex mathematical relationships that have been holding up multi-loop calculations for forty years.

Mira: And they’ve even shown this technique applies to other kinds of multivariate recurrence relations, which expands the utility beyond just Feynman integrals.

Kai: The authors applied it to things like the contiguous relations of the Gauss hypergeometric function, which is a nice connection to other areas we study.

Mira: It suggests that these analytic structures are more general than we might have thought and could open up new ways to represent physical observables in gauge theory amplitudes.

Kai: We need to keep an eye on how this structure translates into something concrete for hardware, because running this kind of calculation on real machines still depends on those rational coefficients being evaluated efficiently.

Mira: Exactly, so the next thing we look at is how fast and stable this method actually runs when we try to put it into a real computational pipeline.

Junhan W. Liu, Alexander Mitov

Cavendish Laboratory, University of Cambridge

hep-ph, hep-th

Submitted: 2025-12-05

Updated: 2026-11-18

The gist: Untangling the Integration-by-Parts Equations presents an algorithm for the diagonalization of IBP equations…

Key concepts

Integration-by-Parts (IBP) Identities
These are fundamental mathematical relations used in calculating Feynman integrals, especially in high-energy physics amplitudes. They allow complex loop integrals to be reduced into simpler 'master integrals.' The challenge is that these equations are often non-diagonal, making them hard to solve analytically.
Diagonalization Methods
This refers to the process of rewriting a system of IBP equations into a diagonal or triangular form. Diagonal forms simplify the problem greatly because each equation relates only one index shift at a time. This transformation is key to finding closed analytic solutions for the identities.
Triangular Algorithm
This is the proposed efficient method for solving IBP equations, characterized by deriving strictly triangular equations without needing back-substitutions. It uses ordering criteria based on integral 'weight' and an ordering parameter to map complex integrals onto simpler ones, leading to faster computation.

Terminology

Summary

Untangling the Integration-by-Parts Equations presents an algorithm for the diagonalization of IBP equations, which are indispensable for reducing loop integrals with high numerator powers to master integrals and for solving IBP identities in closed analytic form The extension of these methods to other multivariate recurrence relations is also discussed. p. 0

The Problem and Motivation

The Integration-by-Parts Identities (IBP) for Feynman integrals have been central to multi-loop amplitude calculations for over four decades It is astonishing that such a centerpiece of amplitude calculations still lacks an analytic solution and the general results known about the IBPs are very few. The standard approach for solving the IBPs is to use Gauss elimination, but methods like Gr¨obner bases, Syzygies, and Symbolic Reduction Rules have been proposed to alleviate the non-diagonal form of these equations. p. 0 The authors propose a systematic diagonalization of IBP identities, which is the first time such a result has been achieved. p. 0

Diagonalization Methods

The paper introduces three different ways of writing a system of IBP equations: diagonal, matrix-diagonal, and triangular forms. The diagonalization procedure is demonstrated using the one-loop box topology as a simple example. p. 1

  1. Diagonal form involves deriving a set of diagonal recurrence relations where each relation shifts one index at a time while keeping all other indices fixed, with the order equaling the number of master integrals in the topology

  2. Matrix-diagonal form reformulates the diagonal equations into a system involving vectors V and matrices W(k), which maps any integral directly to master integrals without leaving unsolved dependent integrals. p. 3

  3. Triangular form is proposed as an efficient approach, characterized by strictly triangular equations that can be directly implemented in existing IBP-solving programs and do not require back-substitutions. p. 5

The Triangular Algorithm Details

The triangular approach is characterized by deriving a relatively small system of equations involving integrals with abstract indices, which are then used to generate the explicit system by providing specific integer values for the abstract indices. The algorithm relies on defining simplicity criteria based on weight w (the negative sum of non-positive indices) and an ordering parameter ∆(Ia, Ib) to order integrals within a sector. p. 6

The process involves mapping any integral in a given sector to strictly simpler integrals in the same sector or sub-sectors, ensuring that the resulting equations are of second order for certain sectors. p. 6 The efficiency is demonstrated by showing that the triangular approach significantly outperforms syzygy-based algorithms in terms of solving time for complex topologies like B1.

Efficiency and Applications

The authors establish a criterion for the efficiency of an IBP-solving algorithm, leading to the proposal of the triangular approach. The triangular equations are noted for not leading to squared propagators, which is a second feature that boosts its efficiency. p. 2

The diagonal equations, especially in the matrix formulation, are indispensable for reducing integrals with high numerator powers or when numerator powers are treated as abstract variables. p. 0 These diagonal IBP equations can make it possible to derive solutions to the IBP identities in closed analytic form. p. 0

Benchmark Results

The triangular algorithm was tested on three two-loop topologies, including the non-planar amplitude for off-shell di-boson production, the planar topology C1, and the most complicated non-planar topology B1. The performance comparison shows that for off-shell di-boson C1, the triangular method was faster than syzygy solutions by a factor of 6. p. 30 in terms of total time. p. 0 Furthermore, the timings using the Fermat library for the triangular approach were noted to be between 50% and a factor of 15 faster than finite field calculations. p. 4 The performance comparison in Table II shows that for off-shell di-boson C1, the triangular method spent about 93% of the time on evaluating rational coefficients and only about 6% in actually solving the IBP equations. p. 5

Conclusion

The work demonstrates that one can diagonalize the IBP equations, and it proposes a new algorithm called triangular which produces strictly triangular form equations. This approach is expected to be very efficient because the triangular equations do not require back-substitutions and do not lead to squared propagators. p. 5 The diagonal equations, particularly in the matrix formulation, are indispensable for reducing integrals with high numerator powers or when numerator powers are treated as abstract variables. p. 0 Possible applications include multivariate Mellin representations for gauge theory amplitudes and cross sections. p. 0 The diagonal IBP equations make it possible to derive solutions to the IBP identities in closed analytic form, which may offer deeper insight into the analytic structures underpinning the set of loop integrals. p. 0 The authors have also successfully applied this technology to seemingly unrelated objects, such as the contiguous relations of the Gauss hypergeometric function. p. 0

Appendix Summary

Appendix A shows that the contiguous relations eqs. (3,4,5) form a closed system with two masters chosen as 2F1(1, 1, 1, z) = (A1). p. 8 Appendix B presents the Fibonacci recurrence in matrix form and its diagonalization using a similarity transformation that yields decoupled first-order recurrence relations for Ga and Gb. p. 1 Appendix C details the diagonal equations for the one-loop box topology, including a second order diagonal equation restricted to the bottom group of sectors (0, 1, 0, 1). p. 2 The appendix also shows that for integer-valued a ≥ c in the contiguous relation example, the function is a rational function without any logarithmic contribution. p. 0 The matrix diagonal formulation maps every integral directly to the set of master integrals, while its seemingly equivalent diagonal formulation leads to a mapping to a wider set of integrals that requires further reduction. p. 3 The triangular approach is characterized by an ordering based on weight w and an ordering parameter ∆(Ia, Ib) which defines simplicity criteria for integrals. p. 6 The algorithm involves iteratively testing a finite subset of shifted IBP equations using rank-based decision processes to find a solution matching the ansatz. p. 9 The triangular approach is at least comparable to existing state-of-the-art approaches and shows strong potential for further speed-up improvements. p. 4

Appendix C Details

Appendix C presents the coefficients rk appearing in eq. (14) for the one-loop box topology. p. 1 It also presents the second order diagonal equation restricted to the bottom group of sectors (0, 1, 0, 1), given by equations (C2) through (C5). p. 3 The derivation of these equations involves a complex procedure where the set of original IBP equations Ei are recast as a linear combination to obtain the desired equation (36). p. 9 The final step involves matching eq. p. 3 (40) to eq. (41) using finite field methods to determine the coefficients cs1,s2,sNp(x). p. 4

Implementation Details

The implementation details describe how to efficiently select the subset of equations by generating them from a specific point in the space of shifts sˆ and applying constraints on si. The shifts are ordered based on the parameter δ = X NP i=1 (ˆsi − si) until a system closes, which is expected to happen at w(I0)+1. p. 8 The algorithm is designed to be efficient, and the size of the resulting equations scales correctly with their complexity. p. 5

Benchmarking Comparison

Table I provides a performance comparison for different topologies and configurations, showing timings for both the syzygy-based algorithm and the triangular approach. The main feature is that the timings using finite field reconstruction with our triangular method and with the syzygies are comparable for all calculations, with differences never exceeding a factor of two. p. 4 The triangular approach was observed to be the fastest performing approach when utilizing the Fermat library, outperforming finite field calculations by between 50% and a factor of 15. p. 4 This suggests that the triangular equations are very efficient in solving the IBP equations. p. 5 The time difference observed between the two approaches scales correctly with the size of the equations, implying that our triangular equations will tremendously benefit from speeding up their evaluation. p. 5

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Develop an algorithm for systematic diagonalization of IBP identities that can be applied to any system of linear homogeneous recurrence relations admitting a finite basis, as described in Section III. This allows for the derivation of diagonal recurrence relations that shift one index at a time while keeping others fixed.

  2. Implement a matrix-diagonal formulation where the diagonal equations are recast into a first-order matrix equation (F = M · F), which is efficient for deriving solutions in analytic form, as noted in Section V. This approach maps every integral directly to the set of master integrals without leaving dependent integrals unsolved.

  3. Create a triangular algorithm that produces a system of strictly triangular equations containing only integrals with no abstract indices, which can be solved by existing IBP-solving programs without requiring back-substitutions, as detailed in Section IV. This algorithm is also noted to not lead to squared propagators, boosting efficiency.

  4. Enhance the rank-based decision process in the iterative solution procedure by ensuring that the condition Rank ε(2)ij = dim ε(2)ij is strictly enforced when including the coefficient of I0, ensuring all ei remain linearly independent in an extended space.

  5. Optimize coefficient determination by directly matching the finite set of equations ei to eq (41) using finite field methods, rather than constructing and solving a linear combination out of an infinite number of equations.

Sources

Related papers