相关论文: Applying Groebner Bases to Solve Reduction Problem…
We suggest a mathematical definition of the notion of master integrals and present a brief review of algorithmic methods to solve reduction problems for Feynman integrals based on integration by parts relations. In particular, we discuss a…
This paper is a detailed description of an algorithm based on a generalized Buchberger algorithm for constructing Groebner-type bases associated with polynomials of shift operators. The algorithm is used for calculating Feynman integrals…
The reduction of Feynman integrals to master integrals is an algebraic problem that requires algorithmic approaches at the modern level of calculations. Straightforward applications of the classical Buchberger algorithm to construct…
We investigate the reduction of Feynman integrals to master integrals using Gr\"obner bases in a rational double-shift algebra Y in which the integration-by-parts (IBP) relations form a left ideal. The problem of reducing a given family of…
In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…
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 this paper we outline the most general and universal algorithmic approach to reduction of loop integrals to basic integrals. The approach is based on computation of Groebner bases for recurrence relations derived from the integration by…
In this paper we consider systems of partial (multidimensional) linear difference equations. Specifically, such systems arise in scientific computing under discretization of linear partial differential equations and in computational high…
Deriving a comprehensive set of reduction rules for Feynman integrals has been a longstanding challenge. In this paper, we present a proposed solution to this problem utilizing generating functions of Feynman integrals. By establishing and…
Standard integration-by-parts (IBP) reduction methods typically yield Feynman integral bases where the reduction of some integrals gives rise to coefficients singular as the dimensional regulator $\epsilon\rightarrow 0$. These singular…
In this paper we present an algorithm for computing Groebner bases of linear ideals in a difference polynomial ring over a ground difference field. The input difference polynomials generating the ideal are also assumed to be linear. The…
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…
We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…
The Gr\"obner basis technique for calculating Feynman diagrams proposed in [O.V. Tarasov, Acta Physica Polonica, v. B29 (1998) 2655] is applied to the two-loop propagator type integrals with arbitrary masses and momentum. We describe the…
An algorithm for the reduction of massive Feynman integrals with any number of loops and external momenta to a minimal set of basic integrals is proposed. The method is based on the new algorithm for evaluating tensor integrals,…
There are several efficient methods to solve linear interval polynomial systems in the context of interval computations, however, the general case of interval polynomial systems is not yet covered as well. In this paper we introduce a new…
In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.
In this paper, we make a contribution to the computation of Gr\"obner bases. For polynomial reduction, instead of choosing the leading monomial of a polynomial as the monomial with respect to which the reduction process is carried out, we…
This paper introduces a strategy for signature-based algorithms to compute Groebner basis. The signature-based algorithms generate S-pairs instead of S-polynomials, and use s-reduction instead of the usual reduction used in the Buchberger…
This short note is the generalization of Faugere F4-algorithm for polynomial rings with coefficients in Euclidean rings. This algorithm computes successively a Groebner basis replacing the reduction of one single s-polynomial in…