Related papers: S-bases as a tool to solve reduction problems for …
Feynman integral reduction based on intersection theory provides an alternative to the traditional integration-by-parts method, yet its practical application has been constrained by the large number of variables required in the computation.…
We use the method of differential equations to analytically evaluate all planar three-loop Feynman integrals relevant for form factor calculations involving massive particles. Our results for ninety master integrals at general $q^2$ are…
We discuss a progress in calculations of Feynman integrals based on the Gegenbauer Polynomial Technique and the Differential Equation Method. We demonstrate the results for a class of two-point two-loop diagrams and the evaluation of most…
Feynman integrals are solutions to linear partial differential equations with polynomial coefficients. Using a triangle integral with general exponents as a case in point, we compare $D$-module methods to dedicated methods developed for…
The integration by parts recurrence relations allow to reduce some Feynman integrals to more simple ones (with some lines missing). Nevertheless the possibility of such reduction for the given particular integral was unclear. The recently…
We present an algorithm for the integrand-level reduction of multi-loop amplitudes of renormalizable field theories, based on computational algebraic geometry. This algorithm uses (1) the Gr\"obner basis method to determine the basis for…
Let K be a field with a valuation and let S be the polynomial ring S:= K[x_1,..., x_n]. We discuss the extension of Groebner theory to ideals in S, taking the valuations of coefficients into account, and describe the Buchberger algorithm in…
We develop the theory of Gr\"obner bases for ideals in a polynomial ring with countably infinite variables over a field. As an application we reconstruct some of the one-one correspondences among various sets of partitions by using division…
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…
This habilitation (German variant of a PhD on top of a PhD) thesis presents the quintessence of the ideas and experiences with Groebner Bases of Birgit Reinert. She died unexpectedly without providing an abstract. As arXiv requires an…
For a fixed Feynman graph one can consider Feynman integrals with all possible powers of propagators and try to reduce them, by linear relations, to a finite subset of integrals, the so-called master integrals. Up to now, there are numerous…
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…
Solving a polynomial system, or computing an associated Gr\"obner basis, has been a fundamental task in computational algebra. However, it is also known for its notorious doubly exponential time complexity in the number of variables in the…
Recently a nice work about the understanding of one-loop integrals has been done in [1] using the tricks of the projective space language associated to their Feynman parametrization. We find this language is also very suitable to deal with…
The new type of ideal basis introduced herein constitutes a compromise between the Gr\"obner bases based on the Buchberger's algorithm and the characteristic sets based on the Wu's method. It reduces the complexity of the traditional…
The two-loop QCD corrections to vector boson pair production at hadron colliders involve a new class of Feynman integrals: two-loop four-point functions with two off-shell external legs. We describe their reduction to a small set of master…
Integration-by-parts (IBP) reduction is one of the essential steps in evaluating Feynman integrals. A modern approach to IBP reduction uses modular arithmetic evaluations with parameters set to numerical values at sample points, followed by…
This paper presents an algorithm for computing Groebner bases based upon labeled polynomials and ideas from the algorithm F5. The main highlights of this algorithm compared with analogues are simplicity both of the algorithm and of the its…
Signature-based algorithms are a popular kind of algorithms for computing Groebner basis, including the famous F5 algorithm, F5C, extended F5, G2V and the GVW algorithm. In this paper, an efficient method is proposed to solve the…
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…