Related papers: On the reduction of Feynman integrals to master in…
Based on the method in Refs.~{\tt [D.~Kreimer, Z.\ Phys.\ C {\bf 54} (1992) 667} and {\tt Int.\ J.\ Mod.\ Phys.\ A {\bf 8} (1993) 1797]}, we present analytic results for scalar one-loop four-point Feynman integrals with complex internal…
In a recent paper \cite{ft} a new powerful method to calculate Feynman diagrams was proposed. It consists in setting up a Taylor series expansion in the external momenta squared. The Taylor coefficients are obtained from the original…
We report on our experiences exploring state of the art Groebner basis computation. We investigate signature based algorithms in detail. We also introduce new practical data structures and computational techniques for use in both signature…
Prime-based ordering which is proved to be admissible, is the encoding of indeterminates in power-products with prime numbers and ordering them by using the natural number order. Using Eiffel, four versions of Buchberger's improved…
We propose a framework for calculating two-loop Feynman diagrams which appear within a renormalizable theory in the general mass case and at finite external momenta. Our approach is a combination of analytical results and of high accuracy…
The $\varepsilon$-form of a system of differential equations for Feynman integrals has led to tremendeous progress in our abilities to compute Feynman integrals, as long as they fall into the class of multiple polylogarithms. It is…
A scheme for systematically achieving accurate numerical evaluation of multi-loop Feynman diagrams is developed. This shows the feasibility of a project aimed to produce a complete calculation for two-loop predictions in the Standard Model.…
We calculate 3-loop master integrals for heavy quark correlators and the 3-loop QCD corrections to the $\rho$-parameter. They obey non-factorizing differential equations of second order with more than three singularities, which cannot be…
The 4-th order Runge-Kutta method in the complex plane is proposed for numerically advancing the solutions of a system of first order differential equations in one external invariant satisfied by the master integrals related to a Feynman…
By introducing an auxiliary parameter, we find a new representation for Feynman integrals, which defines a Feynman integral by analytical continuation of a series containing only vacuum integrals. The new representation therefore…
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…
The integration of differential equations of Feynman integrals can be greatly facilitated by using a canonical basis. This paper presents the Mathematica package CANONICA, which implements a recently developed algorithm to automatize the…
We present $\text{Fuchsia}$ $-$ an implementation of the Lee algorithm, which for a given system of ordinary differential equations with rational coefficients $\partial_x\,\mathbf{f}(x,\epsilon) =…
List decoding of Hermitian codes is reformulated to allow an efficient and simple algorithm for the interpolation step. The algorithm is developed using the theory of Groebner bases of modules. The computational complexity of the algorithm…
We extend Gegenbauer Polynomials technique to evaluate a class of complicated Feynman diagrams. New results in the form of $_3F_2$-hypergeometrical series of unit argument, are presented. As a by-product, we present a new transformation…
The Mellin-Barnes technique to evaluate master integrals and the algorithm called FIRE to solve IBP relations with the help of Groebner bases are briefly reviewed. In FIRE, an extension of the classical Buchberger algorithm to construct…
We study the inversion analog of the well-known Gauss algorithm for multiplying complex matrices. A simple version is $(A + iB)^{-1} = (A + BA^{-1}B)^{-1} - i A^{-1}B(A+BA^{-1} B)^{-1}$ when $A$ is invertible, which may be traced back to…
What can be (machine) learned about the complexity of Buchberger's algorithm? Given a system of polynomials, Buchberger's algorithm computes a Gr\"obner basis of the ideal these polynomials generate using an iterative procedure based on…
Feynman integral reduction based on intersection theory provides an alternative to the traditional integration-by-parts method, yet its practical application has been constrained by the large number of variables required in the computation.…
We study the algebraic and analytic structure of Feynman integrals by proposing an operation that maps an integral into pairs of integrals obtained from a master integrand and a corresponding master contour. This operation is a coaction. It…