论文信息 - Computation of Janet Bases for Toric Ideals

Computation of Janet Bases for Toric Ideals

An algorithm for computation of Janet bases for toric ideals, which is based on the structure of the Janet tree, is suggested. The algorithm can be applied, in particular, to solving integer programming problems with the use of algorithmic ideas by Conti and Traverso.

Yuri A. Blinkov

[1] Vladimir P. Gerdt,et al. Fast Search for the Janet Divisor , 2004, Programming and Computer Software.

[2] Rüdiger L. Urbanke,et al. An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms , 1995, Exp. Math..

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

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

[5] Loïc Pottier,et al. Grobner bases of toric ideals , 1994 .

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

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

[8] Bernd Sturmfels,et al. GRIN: An Implementation of Gröbner Bases for Integer Programming , 1995, IPCO.

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

[10] Joachim Apel,et al. A Gröbner Approach to Involutive Bases , 1995, J. Symb. Comput..

[11] Yuri A. Blinkov. Method of Separative Monomials for Involutive Divisions , 2004, Programming and Computer Software.