Related papers: Generalizations of polylogarithms for Feynman inte…
Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given polynomial. We characterize when such a linearization yields an…
We describe a strategy to solve differential equations for Feynman integrals by powers series expansions near singular points and to obtain high precision results for the corresponding master integrals. We consider Feynman integrals with…
We introduce a symbolic method for the evaluation of definite integrals containing combinations of various functions, including exponentials, logarithm and products of Bessel functions of different types. The method we develop is naturally…
We present an algorithm for determining the minimal order differential equations associated to a given Feynman integral in dimensional or analytic regularisation. The algorithm is an extension of the Griffiths-Dwork pole reduction adapted…
We report our experiences with the generalized integration-by-parts algorithm [hep-ph/9609429] in the context of calculations of a realistic one-loop subset of diagrams.
The ideas behind the concept of algebraic ("integration-by-parts") algorithms for multiloop calculations are reviewed. For any topology and mass pattern, a finite iterative algebraic procedure is proved to exist which transforms the…
Algorithms for numerical computation of symmetric elliptic integrals of all three kinds are improved in several ways and extended to complex values of the variables (with some restrictions in the case of the integral of the third kind).…
We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist $\tau =2$ local operator insertions corresponding to spin $N$. They contribute to the massive operator matrix elements in QCD describing…
We derive an algorithm for computing the total differentials of multi-loop integrals expressed as one-fold integrals of multiple polylogarithms, which can involve square roots of polynomials up to degree four and may evaluate to (elliptic)…
Recently, several people study finite multiple zeta values (FMZVs) and finite polylogarithms (FPs). In this paper, we introduce finite multiple polylogarithms (FMPs), which are natural generalizations of FMZVs and FPs, and we establish…
We introduce the regularized integrals for decorated graphs on elliptic curves, which produces an almost holomorphic function on upper half plane. Then we give the graph version of holomorphic anomaly equation to study the anti-holomorphic…
We give expressions for all generalized polylogarithms up to weight four in terms of the functions log, $\text{Li}_n$, and $\text{Li}_{2,2}$, valid for arbitrary complex variables. Furthermore we provide algorithms for manipulation and…
We show that the calculation of L-loop Feynman integrals in D dimensions can be reduced to a series of matrix multiplications in D times L dimensions. This gives rise to a new type of expansions for the critical exponents in three…
In this paper we introduce the generalization of Multi Poly-Euler polynomials and we investigate some relationship involving Multi Poly-Euler polynomials. Obtaining a closed formula for generalization of Multi Poly-Euler numbers therefore…
xloops is a program package that calculates Feynman diagrams by using computer algebra systems. In this paper it is shown which problems to be solved by computer algebra arise during such calculations, and how this problems are handled in…
In this paper, we propose a new and simple approach to the approximation algorithms that are modified and improved from our published results. The computational and graphical examples are presented with the aid of Maple procedures.
There are three kinds of multiple polylogarithms; complex, finite and symmetric. The dualities for the complex and finite cases are known. In this paper, we present proofs of them via iterated integrals and its symmetric counterpart by a…
A generalization of the classical Lipschitz summation formula is proposed. It involves new polylogarithmic rational functions constructed via the Fourier expansion of certain sequences of Bernoulli--type polynomials. Related families of…
We present a Mathematica package AmpRed for the semi-automatic calculations of multi-loop Feynman amplitudes with high efficiency and precision. AmpRed implements the methods of integration by parts and differential equations in the…
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…