Related papers: A New Algorithm For The Generation Of Unitarity-Co…
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…
An algorithm for calculating two-loop propagator type Feynman diagrams with arbitrary masses and external momentum is proposed. Recurrence relations allowing to express any scalar integral in terms of basic integrals are given. A minimal…
In this paper we extend the idea of integration to generic algebras. In particular we concentrate over a class of algebras, that we will call self-conjugated, having the property of possessing equivalent right and left multiplication…
The analytic integration and simplification of multi-loop Feynman integrals to special functions and constants plays an important role to perform higher order perturbative calculations in the Standard Model of elementary particles. In this…
In this paper, we develop an iterative sector-level reduction strategy for Feynman integrals, which bases on module intersection in the Baikov representation and auxiliary vector for tensor structure. Using this strategy we have studied the…
We present a new program package for calculating one-loop Feynman integrals, based on a new method avoiding Feynman parametrization and the contraction due to Passarino and Veltman. The package is calculating one-, two- and three-point…
Clustering algorithms remain valuable tools for grouping and summarizing the most important aspects of data. Example areas where this is the case include image segmentation, dimension reduction, signals analysis, model order reduction,…
We find that all Feynman integrals (FIs), having any number of loops, can be completely determined once linear relations between FIs are provided. Therefore, FIs computation is conceptually changed to a linear algebraic problem. Examples up…
Data processing systems roughly group into families such as relational, array, graph, and key-value. Many data processing tasks exceed the capabilities of any one family, require data stored across families, or run faster when partitioned…
In this work we present the computer algebra package HarmonicSums and its theoretical background for the manipulation of harmonic sums and some related quantities as for example Euler-Zagier sums and harmonic polylogarithms. Harmonic sums…
We introduce a machine-learning framework based on symbolic regression to extract the full symbol alphabet of multi-loop Feynman integrals. By targeting the analytic structure rather than reduction, the method is broadly applicable and…
Integration by parts identities (IBPs) can be used to express large numbers of apparently different d-dimensional Feynman Integrals in terms of a small subset of so-called master integrals (MIs). Using the IBPs one can moreover show that…
Two fundamental algorithm-design paradigms are Tree Search and Dynamic Programming. The techniques used therein have been shown to complement one another when solving the complete set partitioning problem, also known as the coalition…
Polylogrithmic functions, such as the logarithm or dilogarithm, satisfy a number of algebraic identities. For the logarithm, all the identities follow from the product rule. For the dilogarithm and higher-weight classical polylogarithms,…
We present a method for rewriting dimensionally regulated Feynman parameter integrals in the Minkowski regime as a sum of real, positive integrands multiplied by complex prefactors. This representation eliminates the need for contour…
Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…
An efficient way to calculate one-loop counterterms within the Feynman diagrammatic approach and dimensional regularization is to expand the propagators in the integrands of the Feynman integrals around vanishing external momentum. In this…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
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…
We apply numerical optimization and linear algebra algorithms for classical computers to the problem of automatically synthesizing algorithms for quantum computers. Using our framework, we apply several common techniques from these…