Add to ORKGThis 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 and has proven itself efficient in several complicated cases
Grobner basis calculation forms a key part of computational commutative algebra and many other areas...
Gröbner bases are special sets of polynomials, which are useful to solve problems in many fields suc...
We study the complexity of Gröbner bases computation, in particular in the generic situation where ...
is paper we describe how an idea centered on the concept of self-saturation allows several improveme...
In this paper we describe how an idea centered on the concept of self-saturation allows several impr...
In this paper we outline the most general and universal algorithmic approach to reduction of loop in...
Abstract—In this paper we improve the computer algorithm of Zhou and Winkler for computing relative ...
Groebner bases have many applications in mathematics, science, and engineering. This dissertation de...
This paper will explore the use and construction of Gröbner bases through Buchberger\u27s algorithm....
Computation of two Groebner bases required by our algorithm for transforming cartesian coordinates i...
Groebner basis are an important theoretical building block of modern (polynomial) ring theory. The o...
We study Groebner bases and their applications in our thesis. We give a detailed proof of Dickson\u2...
In this dissertation we study several improvements to algorithms used to generate comprehensive Groe...
At a Dagstuhl meeting a few years ago, I gave a tutorial lecture about Groebner bases whose emphasis...
The Grobner basis technique for calculating Feynman diagrams proposed in [O.V. Tarasov, Acta Physica...
Grobner basis calculation forms a key part of computational commutative algebra and many other areas...
Gröbner bases are special sets of polynomials, which are useful to solve problems in many fields suc...
We study the complexity of Gröbner bases computation, in particular in the generic situation where ...
is paper we describe how an idea centered on the concept of self-saturation allows several improveme...
In this paper we describe how an idea centered on the concept of self-saturation allows several impr...
In this paper we outline the most general and universal algorithmic approach to reduction of loop in...
Abstract—In this paper we improve the computer algorithm of Zhou and Winkler for computing relative ...
Groebner bases have many applications in mathematics, science, and engineering. This dissertation de...
This paper will explore the use and construction of Gröbner bases through Buchberger\u27s algorithm....
Computation of two Groebner bases required by our algorithm for transforming cartesian coordinates i...
Groebner basis are an important theoretical building block of modern (polynomial) ring theory. The o...
We study Groebner bases and their applications in our thesis. We give a detailed proof of Dickson\u2...
In this dissertation we study several improvements to algorithms used to generate comprehensive Groe...
At a Dagstuhl meeting a few years ago, I gave a tutorial lecture about Groebner bases whose emphasis...
The Grobner basis technique for calculating Feynman diagrams proposed in [O.V. Tarasov, Acta Physica...
Grobner basis calculation forms a key part of computational commutative algebra and many other areas...
Gröbner bases are special sets of polynomials, which are useful to solve problems in many fields suc...
We study the complexity of Gröbner bases computation, in particular in the generic situation where ...