Related papers: Two decades of algorithmic Feynman integral reduct…
In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…
We introduce a novel structure for Feynman integrals, reformulating them as integrals over a small set of parameters with a fully controllable integrand. The integrand closely resembles one-loop Feynman integrals, and they are very easy to…
In this article, we present a new implementation of the Laporta algorithm to reduce scalar multi-loop integrals---appearing in quantum field theoretic calculations---to a set of master integrals. We extend existing approaches by using an…
In this paper we describe a variation of the classical permutation decoding algorithm that can be applied to any affine-invariant code with respect to certain type of information sets. In particular, we can apply it to the family of…
A purely numerical method, Direct ComputationMethod is applied to evaluate Feynman integrals. This method is based on the combination of an efficient numerical integration and an efficient extrapolation. In addition, high-precision…
We present an algorithm for computing a holonomic system for a definite integral of a holonomic function over a domain defined by polynomial inequalities. If the integrand satisfies a holonomic difference-differential system including…
A numerical program is presented which facilitates the computation of the full set of one-gluon loop diagrams (including ghost loop contributions), with M attached external gluon lines in all possible ways. The feasibility of such a task…
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 motivate the use of quantum algorithms in particle physics and provide a brief overview of the most recent applications at high-energy colliders. In particular, we discuss in detail how a quantum approach reduces the complexity of jet…
In this paper we exploit factorisation properties of Picard-Fuchs operators to decouple differential equations for multi-scale Feynman integrals. The algorithm reduces the differential equations to blocks of the size of the order of the…
Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide application. Because of its relative maturity, computational…
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…
We reduce all the most complicated Feynman integrals in two-loop five-light-parton scattering amplitudes to basic master integrals, while other integrals can be reduced even easier. Our results are expressed as systems of linear relations…
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…
Integration by parts reduction is a standard component of most modern multi-loop calculations in quantum field theory. We present a novel strategy constructed to overcome the limitations of currently available reduction programs based on…
We take the first step in generalizing the so-called "Schubert analysis", originally proposed in twistor space for four-dimensional kinematics, to the study of symbol letters and more detailed information on canonical differential equations…
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…
Discovering "good" algorithms for an operation is often considered an art best left to experts. What if there is a simple methodology, an algorithm, for systematically deriving a family of algorithms as well as their cost analyses, so that…
An automated treatment of iterated integrals based on letters induced by real-valued quadratic forms and Kummer--Poincar\'e letters is presented. These quantities emerge in analytic single and multi--scale Feynman diagram calculations. To…
In [4] we describe a variation of the classical permutation decoding algorithm that can be applied to any binary affine-invariant code; in particular, it can be applied to first-order Reed-Muller codes successfully. In this paper we study…