On the relation between Pommaret and Janet bases (Q2702007)

This paper is devoted to study relations between Pommaret and Janet bases of polynomial ideals and how these relations can be exploited to construct Janet bases. A result by \textit{A. Yu. Zharkov} [``Involutive polynomial bases: General case'', Preprint JINR E5-94-224 (Dubna 1994)], which gives inclusions between P-multiplicative and J-multiplicative variables, allows the author to mix the Pommaret and Janet conventional autoreductions. The output of this new Pommaret-Janet autoreduction algorithm is a set of polynomials both Pommaret and Janet autoreduced. The main theorem characterizes the existence of finite Pommaret bases. The Janet basis algorithm is based in the previous theorem and it constructs J-bases of polynomial ideals generated by an input polynomial set. The different kinds of outputs are explained. As the author says, this algorithm is the involutive basis algorithm presented by \textit{V. P. Gerdt} and \textit{Yu. A. Blinkov} [Math. Comput. Sim. 45, 519-541 (1998)] but the conventional Janet autoreduction in the involutive basis algorithm is replaced by the Pommaret-Janet autoreduction in the Janet basis one. Finally, the author says that the results can be extended to differential polynomial rings. For the entire collection see [Zbl 0951.00046].