Related papers: Integration-by-parts reductions of Feynman integra…
We present an algorithm for the integrand-level reduction of multi-loop amplitudes of renormalizable field theories, based on computational algebraic geometry. This algorithm uses (1) the Gr\"obner basis method to determine the basis for…
Integer relation algorithms can convert numerical results for Feynman integrals to exact evaluations, when one has reason to suspect the existence of reductions to linear combinations of a basis, with rational or algebraic coefficients.…
We introduce a new version v1.1 of NeatIBP. In this new version, a Kira interface is included. It allows the user to reduce the integration-by-parts (IBP) identity systems generated by NeatIBP using Kira in a highly automated way. This new…
We propose that Feynman integral reduction is controlled by solutions of the Landau equations. We study integral relations with prescribed propagator powers using syzygy methods and discuss how syzygies can be expressed as a sum over…
We introduce a machine-learning framework based on symbolic regression to extract the full symbol alphabet of multi-loop Feynman integrals. By targeting the analytic structure rather than reduction, the method is broadly applicable and…
A systematic study of the scalar one-loop two-, three-, and four-point Feynman integrals is performed. We consider all cases of mass assignment and external invariants and derive closed expressions in arbitrary space-time dimension in terms…
We introduce a new approach for the computation of the class of Feynman integrals whose integrands vanish in strictly four-dimensions, so-called ''pseudo-evanescent'' integrals. We argue that, up to $\mathcal{O}(\epsilon)$ corrections,…
Following our previous study of the recursive structure of Baikov representations, we discuss its application in the integration-by-parts reduction of Feynman integrals. We combine the top-down reduction approach with the recursive…
A Mathematica implementation of the program LERG-I is presented that performs the reduction of tensor integrals, encountered in one-loop Feynman diagram calculations, to scalar integrals. The program was originally coded in REDUCE and in…
This paper is concerned with the exact solution of mixed-integer programs (MIPs) over the rational numbers, i.e., without any roundoff errors and error tolerances. Here, one computational bottleneck that should be avoided whenever possible…
The Feynman integral is one of the most accurate methods for calculating density operator dynamics in open quantum systems. However, the number of time steps that can realistically be used is always limited, therefore one often obtains an…
This study investigates computationally efficient inner-loop algorithms for estimating static/dynamic BLP models. It provides the following ideas for reducing the number of inner-loop iterations: (1). Add a term relating to the outside…
One of the most severe bottlenecks to reach high-precision predictions in QFT is the calculation of multiloop multileg Feynman integrals. Several new strategies have been proposed in the last years, allowing impressive results with deep…
The ADMM-based interior point (ABIP, Lin et al. 2021) method is a hybrid algorithm that effectively combines interior point method (IPM) and first-order methods to achieve a performance boost in large-scale linear optimization. Different…
We present recent computer algebra methods that support the calculations of (multivariate) series solutions for (certain coupled systems of partial) linear differential equations. The summand of the series solutions may be built by…
We calculate the three-loop master integrals contributing to the three-loop five-point amplitude on the special Coulomb branch of $\mathcal{N}=4$ SYM theory. For the genuine pentagon integrals, we follow the approach of Ref. [JHEP 12 (2025)…
We present a novel relaxation framework for general mixed-integer nonlinear programming (MINLP) grounded in computational geometry. Our approach constructs polyhedral relaxations by convexifying finite sets of strategically chosen points,…
In this paper we develop further and refine the method of differential equations for computing Feynman integrals. In particular, we show that an additional iterative structure emerges for finite loop integrals. As a concrete non-trivial…
In this paper, we introduce a simple and efficient approach for the general reduction of one-loop integrals. Our method employs the introduction of an auxiliary vector and the identification of the tensor structure as an auxiliary…
Modern advances in particle physics depend strongly on the usage of reliable computer programs. In this context two issues become important: The usage of powerful algorithms to handle the amount of evaluated data properly, and a software…