论文信息 - On selection of nonmultiplicative prolongations in computation of Janet bases

On selection of nonmultiplicative prolongations in computation of Janet bases

We consider three modifications of our basic involutive algorithm for computing polynomial Janet bases. These modifications, which are related to degree-compatible monomial orders, yield specific selection strategies for nonmultiplicative prolongations. Using a standard database of benchmarks designed for testing programs computing Gröbner bases, we compare these algorithmic modifications (in terms of their efficiency) with Faugére’s F4 algorithm, which is built in the Magma computer algebra system.

Vladimir P. Gerdt | Yuri A. Blinkov | V. Gerdt | Y. A. Blinkov

[1] J. Faugère. A new efficient algorithm for computing Gröbner bases (F4) , 1999 .

[2] Vladimir P. Gerdt,et al. Construction of Janet Bases I. Monomial Bases , 2001, CASC.

[3] Maurice Janet,et al. Leçons sur les systèmes d'équations aux dérivées partielles , 1930, Nature.

[4] Michael Kalkbrener,et al. Converting Bases with the Gröbner Walk , 1997, J. Symb. Comput..

[6] Vladimir P. Gerdt,et al. Janet-Like Monomial Division , 2005, CASC.

[7] Roberto La Scala,et al. Computing Toric Ideals , 1999, J. Symb. Comput..

[8] Yuri A. Blinkov,et al. Involutive bases of polynomial ideals , 1998, math/9912027.

[9] Carlo Traverso,et al. “One sugar cube, please” or selection strategies in the Buchberger algorithm , 1991, ISSAC '91.

[10] Carlo Traverso,et al. Buchberger Algorithm and Integer Programming , 1991, AAECC.

[11] Jean-Charles Faugère,et al. Efficient Computation of Zero-Dimensional Gröbner Bases by Change of Ordering , 1993, J. Symb. Comput..

[12] B. Buchberger,et al. Grobner Bases : An Algorithmic Method in Polynomial Ideal Theory , 1985 .