Detecting unnecessary reductions in an involutive basis computation

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 Grobner 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 [Gerdt, V.P., Blinkov, Y.A., 1998. Involutive bases of polynomial ideals. Mathematics and Computers in Simulation 45, 519-541] were the first who applied these criteria in involutive basis computations. We present criteria which are also transferred from the theory of Grobner bases to involutive basis computations. We illustrate that our results exploit the Grobner basis theory slightly 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 also be used in algebras of solvable type, e.g., Weyl algebras or enveloping algebras of Lie algebras, in full analogy to the Grobner basis case. We show that the application of criteria enforces the termination of the involutive basis algorithm independent of the prolongation selection strategy.