Related papers: Algebraic algorithms for multiloop calculations. T…
Integration-by-parts (IBP) identities and differential equations are the primary modern tools for the evaluation of high-order Feynman integrals. They are commonly derived and implemented in the momentum-space representation. We provide a…
We present the powerful module-intersection integration-by-parts (IBP) method, suitable for multi-loop and multi-scale Feynman integral reduction. Utilizing modern computational algebraic geometry techniques, this new method successfully…
A fully numerical method to calculate loop integrals, a numerical contour-integration method, is proposed. Loop integrals can be interpreted as a contour integral in a complex plane for an integrand with multi-poles in the plane. Stable and…
We introduce a new method to evaluate algebraic integrals over the simplex numerically. This new approach employs techniques from tropical geometry and exceeds the capabilities of existing numerical methods by an order of magnitude. The…
The evaluation of multi-loop Feynman integrals is one of the main challenges in the computation of precise theoretical predictions for the cross sections measured at the LHC. In recent years, the method of differential equations has proven…
We present algorithms to work with iterated Eisenstein integrals that have recently appeared in the computation of multi-loop Feynman integrals. These algorithms allow one to analytically continue these integrals to all regions of the…
We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.
In a recent paper we have presented an automated subtraction method for divergent multi-loop/leg integrals in dimensional regularisation which allows for their numerical evaluation, and applied it to diagrams with massless internal lines.…
We introduce a class of iterated integrals, defined through a set of linearly independent integration kernels on elliptic curves. As a direct generalisation of multiple polylogarithms, we construct our set of integration kernels ensuring…
Loop invariants are properties of a program loop that hold before and after each iteration of the loop. They are often employed to verify programs and ensure that algorithms consistently produce correct results during execution.…
The method of differential equations has been proven to be a powerful tool for the computation of multi-loop Feynman integrals appearing in quantum field theory. It has been observed that in many instances a canonical basis can be chosen,…
We review recent developments in the study of multiple polylogarithms, including the Hopf algebra of the multiple polylogarithms and the symbol map, as well as the construction of single valued multiple polylogarithms and discuss an…
We report on the new functionality of the open-source Mathematica package FeynCalc relevant for multiloop calculations. In particular, we focus on such tasks as topology identification by means of the Pak algorithm, search for equivalent…
We find that all Feynman integrals (FIs), having any number of loops, can be completely determined once linear relations between FIs are provided. Therefore, FIs computation is conceptually changed to a linear algebraic problem. Examples up…
In this article algebraic constructions are introduced in order to study the variety defined by a radical parametrization (a tuple of functions involving complex numbers, $n$ variables, the four field operations and radical extractions). We…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
Integration by parts reduction is a standard component of most modern multi-loop calculations in quantum field theory. We present a novel strategy constructed to overcome the limitations of currently available reduction programs based on…
In this work, we systematically analyse Feynman integrals in the `t Hooft-Veltman scheme. We write an explicit reduction resulting from partial fractioning the high-multiplicity integrands to a finite basis of topologies at any given loop…
We present a novel algebraic combinatorial view on low-rank matrix completion based on studying relations between a few entries with tools from algebraic geometry and matroid theory. The intrinsic locality of the approach allows for the…
We review a method for the algebraic treatment of a family of functions which contains the multiple polylogarithms, with applications to the symbolic calculation of Feynman integrals.