Detecting unnecessary reductions in an involutive basis computation

Abstract

We consider the check of the involutive basis property in a polynomial context. In order to show that a finite generating set F of a polynomial ideal I is an involutive basis one must confirm two properties. Firstly, the set of leading terms of the elements of F has to be complete. Secondly, one has to prove that F is a Gröbner basis of I. The latter is the time critical part but can be accelerated by application of Buchberger's criteria including the many improvements found during the last two decades. Gerdt and Blinkov (Involutive Bases of Polynomial Ideals. Mathematics and Computers in Simulation 45, pp. 519-541, 1998) were the first who applied these criteria in involutive basis computations. We present criteria which are also transfered from the theory of Gröbner bases to involutive basis computations. We illustrate that our results exploit the Gröbner basis theory slightely more than those of Gerdt and Blinkov. Our criteria apply in all cases where those of Gerdt/Blinkov do, but we also present examples where our criteria are superior. Some of our criteria can be used also in algebras of solvable type, e. g., Weyl algebras or enveloping algebras of Lie algebras, in full analogy to the Gröbner basis case. We show that the application of criteria enforces the termination of the involutive basis algorithm independent of the prolongation selection strategy.

Gröbner Bases and Generation of Difference Schemes for Partial Differential Equations

“…To do the elimination from the nonlinear system (37) we apply the Gröbner factoring approach [44]: if a Gröbner basis contains a polynomial which factors, then the computation is split into the computation of two or more Gröbner bases corresponding to the factors. In doing so, we choose the elimination ranking u xx u x u t f x f u and compute two Gröbner bases, for every factor in (37). Then we compose the product of two obtained difference polynomials in u and f that gives us the Godunov-type difference scheme:…”

Parallel computation of Janet and Gr�bner bases over rational numbers

“…It should be noted that the two criteria used in the HNF J (p, T) subalgorithm do not completely cover the Buchberger criteria, which was demonstrated in [18]. Some zero reductions can be found by means of two additional criteria formulated in [18].…”

A pommaret division algorithm for computing Grobner bases in boolean rings

“…Involutive criteria detecting some of S− polynomials of form (10) which are superfluous have not been implemented yet in the package. The full set of involutive criteria equivalent in the aggregate [19] to the Buchberger criteria [16] includes two criteria designed in [12] and two more criteria designed in [19]. In doing so, the last two criteria are usually applicable much more seldom than the first two ones.…”