Related papers: On the reduction of Feynman integrals to master in…
Developed by Buchberger for commutative polynomial rings, Groebner Bases are frequently applied to solve algorithmic problems, such as the congruence problem for ideals. Until now, these ideas have been transmitted to different in part…
In the context of high-energy particle physics, a reliable theory-experiment confrontation requires precise theoretical predictions. This translates into accessing higher-perturbative orders, and when we pursue this objective, we inevitably…
There is a number of known NP class problems, and majority of them have been shown to be equivalent to others. In particular now it is clear that construction of a Gr\"{o}bner basis (or Buchberger algorithm) must be one of equivalent…
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…
A Grobner basis-based algorithm for solving the Frobenius Instance Problem is presented, and this leads to an algorithm for solving the Frobenius Problem that can handle numbers with thousands of digits. Connections to irreducible…
To compute difference Groebner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the…
In this paper we present the formal, computer-supported verification of a functional implementation of Buchberger's critical-pair/completion algorithm for computing Gr\"obner bases in reduction rings. We describe how the algorithm can be…
Reduction of high-loop Feynman integrals is one of the main tasks in scatting amplitude. In this paper, a new representation of Feynman integrals proposed by Chen in [1,2] is considered. We combined Chen's method with "syzygy" trick to…
This paper describes a Buchberger-style algorithm to compute a Groebner basis of a polynomial ideal, allowing for a selection strategy based on "signatures". We explain how three recent algorithms can be viewed as different strategies for…
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…
Feynman integrals play a central role in the modern scattering amplitudes research program. Advancing our methods for evaluating Feynman integrals will, therefore, strengthen our ability to compare theoretical predictions with data from…
I present a numerical algorithm for direct evaluation of multiple Grassmann integrals. The approach is exact and suffers no Fermion sign problems. Memory requirements grow exponentially with the interaction range and the transverse size of…
We present an efficient graphical approach to construct projectors for the tensor reduction of multi-loop Feynman integrals with both Lorentz and spinor indices in $D$ dimensions. An ansatz for the projectors is constructed making use of…
The famous F5 algorithm for computing Gr\"obner basis was presented by Faug\`ere in 2002 without complete proofs for its correctness. The current authors have simplified the original F5 algorithm into an F5 algorithm in Buchberger's style…
Parametric Feynman integrals with the regions of integration defined by some polynomials are considered in this paper. It is shown that integrals with irregular integration regions can be converted to standard parametric integrals, for…
A method for reducing Feynman integrals, depending on several kinematic variables and masses, to a combination of integrals with fewer variables is proposed. The method is based on iterative application of functional equations proposed by…
Let T(x) in k[x] be a monic non-constant polynomial and write R=k[x] / (T) the quotient ring. Consider two bivariate polynomials a(x, y), b(x, y) in R[y]. In a first part, T = p^e is assumed to be the power of an irreducible polynomial p. A…
We present a new algorithm for integration-by-parts (IBP) reduction of Feynman integrals with high powers of numerators or propagators, a demanding computational step in evaluating multi-loop scattering amplitudes. The algorithm starts with…
We discuss a progress in calculation of Feynman integrals which has been done with help of the differential equation method and demonstrate the results for a class of two-point two-loop diagrams.
We consider the three-loop mixed strong-electroweak (${\mathcal{O}}(\alpha \alpha_s^2)$) corrections to the quark form factor. We compute the master integrals which are appearing in the Feynman diagrams containing a single massive boson in…