Related papers: RationalizeRoots: Software Package for the Rationa…
Feynman integral computations in theoretical high energy particle physics frequently involve square roots in the kinematic variables. Physicists often want to solve Feynman integrals in terms of multiple polylogarithms. One way to obtain a…
In the computation of Feynman integrals which evaluate to multiple polylogarithms one encounters quite often square roots. To express the Feynman integral in terms of multiple polylogarithms, one seeks a transformation of variables, which…
Feynman integrals are very often computed from their differential equations. It is not uncommon that the $\varepsilon$-factorised differential equation contains only dlog-forms with algebraic arguments, where the algebraic part is given by…
In this talk, we discuss recent progress in the application of generalizations of polylogarithms in the symbolic computation of multi-loop integrals. We briefly review the Maple program MPL which supports a certain approach for the…
We provide algorithms for symbolic integration of hyperlogarithms multiplied by rational functions, which also include multiple polylogarithms when their arguments are rational functions. These algorithms are implemented in Maple and we…
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.
We devise a simple but remarkably accurate iterative routine for calculating the roots of a polynomial of any degree. We demonstrate that our results have significant improvement in accuracy over those obtained by methods used in popular…
In 2021, Marco Besier and the first author introduced the concept of rationalizability of square roots to simplify arguments of Feynman integrals. In this work, we generalize the definition of rationalizability to field extensions. We then…
The computation of higher order processes very often involves a large number of diagrams. In addition, it is in general not possible to solve the occurring integrals explicitly and expansions in small quantities have to be performed. This…
We review an approach for the computation of Feynman integrals by use of multiple polylogarithms, with an emphasis on the related criterion of linear reducibility of the graph. We show that the set of graphs which satisfies the linear…
We describe three algorithms for computer-aided symbolic multi-loop calculations that facilitated some recent novel results. First, we discuss an algorithm to derive the canonical form of an arbitrary Feynman integral in order to facilitate…
We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…
We investigate the behaviour of elliptic Feynman integrals under modular transformations. This has a practical motivation: Through a suitable modular transformation we can achieve that the nome squared is a small quantity, leading to fast…
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 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,…
Factorization of polynomials is one of the foundations of symbolic computation. Its applications arise in numerous branches of mathematics and other sciences. However, the present advanced programming languages such as C++ and J++, do not…
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 present a Mathematica package which finds a basis of master integrals for the Feynman integral reduction. In this basis the dependence on the dimensional regularization in the denominators factorizes in kinematic independent polynomials.
Feynman integral reduction by means of integration-by-parts identities is a major power gadget in a theorist toolbox indispensable for calculation of multiloop quantum effects relevant for particle phenomenology and formal theory alike. An…
The standard procedure when evaluating integrals of a given family of Feynman integrals, corresponding to some Feynman graph, is to construct an algorithm which provides the possibility to write any particular integral as a linear…