Related papers: S-bases as a tool to solve reduction problems for …
The problem of simplifying tensor expressions is addressed in two parts. The first part presents an algorithm designed to put tensor expressions into a canonical form, taking into account the symmetries with respect to index permutations…
The existence of a finite basis of algebraically independent one-loop integrals has underpinned important developments in the computation of one-loop amplitudes in field theories and gauge theories in particular. We give an explicit…
In this manuscript, which is to appear in the proceedings of the conference "MathemAmplitude 2019" in Padova, Italy, we provide an overview of the module intersection method for the the integration-by-parts (IBP) reduction of multi-loop…
For loop integrals, the standard method is reduction. A well-known reduction method for one-loop integrals is the Passarino-Veltman reduction. Inspired by the recent paper [1] where the tadpole reduction coefficients have been solved, in…
We evaluate analytically the master integrals for one of two types of planar families contributing to massive two-loop Bhabha scattering in QED. As in our previous paper, we apply a recently suggested new strategy to solve differential…
We apply the theory of Groebner bases to the computation of free resolutions over a polynomial ring, the defining equations of a canonically embedded curve, and the unirationality of the moduli space of curves of a fixed genus.
In this paper, we describe a numerical approach to evaluate Feynman loop integrals. In this approach the key technique is a combination of a numerical integration method and a numerical extrapolation method. Since the computation is carried…
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…
We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…
Canonical Feynman integrals are of great interest in the study of scattering amplitudes at the multi-loop level. We propose to construct $d\log$-form integrals of the hypergeometric type, treat them as a representation of Feynman integrals,…
In this talk I give an elementary introduction to the key algorithm used in recent applications of computational algebraic geometry to the subject of string phenomenology. I begin with a simple description of the algorithm itself and then…
I discuss algorithms for the evaluation of Feynman integrals. These algorithms are based on Hopf algebras and evaluate the Feynman integral to (multiple) polylogarithms.
We present in detail two resummation methods emerging from the application of the Simplified Differential Equations approach to a canonical basis of master integrals. The first one is a method which allows for an easy determination of the…
We introduce the theory of monoidal Groebner bases, a concept which generalizes the familiar notion in a polynomial ring and allows for a description of Groebner bases of ideals that are stable under the action of a monoid. The main…
In this talk I review the connections between Feynman integrals and multiple polylogarithms. After an introductory section on loop integrals I discuss the Mellin-Barnes transformation and shuffle algebras. In a subsequent section multiple…
The status of analytical evaluation of double and triple box diagrams is characterized. The method of Mellin-Barnes representation as a tool to evaluate master integrals in these problems is advocated. New MB representations for massive…
We report on three improvements in the context of Feynman integral reduction and $\varepsilon$-factorised differential equations: Firstly, we show that with a specific choice of prefactors, we trivialise the $\varepsilon$-dependence of the…
Minimal problems in computer vision raise the demand of generating efficient automatic solvers for polynomial equation systems. Given a polynomial system repeated with different coefficient instances, the traditional Gr\"obner basis or…
We investigate the application of syzygies for efficiently computing (finite) Pommaret bases. For this purpose, we first describe a non-trivial variant of Gerdt's algorithm to construct an involutive basis for the input ideal as well as an…
In these lectures I will give an introduction to Feynman integrals. In the first part of the course I review the basics of the perturbative expansion in quantum field theories. In the second part of the course I will discuss more advanced…