Related papers: Reduction to master integrals via intersection num…
We introduce a problem class we call Polynomial Constraint Satisfaction Problems, or PCSP. Where the usual CSPs from computer science and optimization have real-valued score functions, and partition functions from physics have monomials,…
For the investigation of higher order Feynman integrals, potentially with tensor structure, it is highly desirable to have numerical methods and automated tools for dedicated, but sufficiently 'simple' numerical approaches. We elaborate two…
Numerical evaluations of Feynman integrals often proceed via a deformation of the integration contour into the complex plane. While valid contours are easy to construct, the numerical precision for a multi-loop integral can depend…
A method for the evaluation of the epsilon expansion of multi-loop massless Feynman integrals is introduced. This method is based on the Gegenbauer polynomial technique and the expansion of the Gamma function in terms of harmonic sums.…
Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…
We present the integrand reduction via multivariate polynomial division as a natural technique to encode the unitarity conditions of Feynman amplitudes. We derive a recursive formula for the integrand reduction, valid for arbitrary…
An algorithm for the systematic analytical approximation of multi-scale Feynman integrals is presented. The algorithm produces algebraic expressions as functions of the kinematical parameters and mass scales appearing in the Feynman…
Differential equations are a powerful tool for evaluating Feynman integrals. Their solution is straightforward if a transformation to a canonical form is found. In this paper, we present an algorithm for finding such a transformation. This…
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…
Building on the idea of numerically integrating differential equations satisfied by Feynman integrals, we propose a novel strategy for handling branch cuts within a numerical framework. We develop an integrator capable of evaluating a basis…
We present general prescriptions for the asymptotic expansion of massive multi-loop Feynman integrals near threshold. As in the case of previously known prescriptions for various limits of momenta and masses, the terms of the threshold…
We propose that the concept of multidimensional residues can be used to directly extracting the coefficients of scalar master integrals (with single propagators only) from one-loop Feynman integrals with generic power of propagators. Unlike…
The differential-reduction algorithm, which allows one to express generalized hypergeometric functions with parameters of arbitrary values in terms of such functions with parameters whose values differ from the original ones by integers, is…
We consider space-saving versions of several important operations on univariate polynomials, namely power series inversion and division, division with remainder, multi-point evaluation, and interpolation. Now-classical results show that…
This paper presents a program analysis method that generates program summaries involving polynomial arithmetic. Our approach builds on prior techniques that use solvable polynomial maps for summarizing loops. These techniques are able to…
All one-massless-loop Feynman diagrams could be written like a linear combination of scalar boxes, triangles an bubbles in $n$ dimensions plus rational terms. However, the four-point scalar integrals in $n+2$ dimensions are free of infrared…
This study presents the derivation of a recursive formula for integrals of products of $N$ Hermite polynomials, establishing a numerically stable scheme for their accurate evaluation in computer codes. The derivation is notably simple and…
Differential equations are a powerful tool to tackle Feynman integrals. In this talk we discuss recent progress, where the method of differential equations has been applied to Feynman integrals which are not expressible in terms of multiple…
The method of canonical differential equations is an important tool in the calculation of Feynman integrals in quantum field theories. It has been realized that the canonical bases are closely related to $d$-dimensional $d\log$-form…
Several applications of slicing require a program to be sliced with respect to more than one slicing criterion. Program specialization, parallelization and cohesion measurement are examples of such applications. These applications can…