论文信息 - A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases

A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases

We introduce a simple algorithm to compute comprehensive Gröbner bases. It requires only computations of reduced Gröbner bases in polynomial rings over ground fields. It is so simple that we can easily implement it on any computer algebra system that has a routine to compute reduced Gröbner bases. Our implementations on several computer algebra systems show that it is also sufficiently fast comparing with other existing algorithms.

Akira Suzuki | Yosuke Sato | Yosuke Sato | A. Suzuki

[1] Thomas Sturm,et al. REDLOG: computer algebra meets computer logic , 1997, SIGS.

[2] Akira Suzuki,et al. An alternative approach to comprehensive Gröbner bases , 2002, ISSAC '02.

[3] Heinz Kredel,et al. Gröbner Bases: A Computational Approach to Commutative Algebra , 1993 .

[4] Volker Weispfenning,et al. Canonical comprehensive Gröbner bases , 2002, ISSAC '02.

[5] Volker Weispfenning,et al. Comprehensive Gröbner Bases , 1992, J. Symb. Comput..

[6] Antonio Montes,et al. A New Algorithm for Discussing Gröbner Bases with Parameters , 2002, J. Symb. Comput..

[7] Masayuki Noro,et al. Risa/Asir—a computer algebra system , 1992, ISSAC '92.

[8] Antonio Montes,et al. Improving the DISPGB algorithm using the discriminant ideal , 2006, J. Symb. Comput..

[9] Thomas Becker,et al. On Gröbner bases under specialization , 2005, Applicable Algebra in Engineering, Communication and Computing.

[10] 佐藤洋祐,et al. 特集 Comprehensive Grobner Bases , 2007 .

[11] Michael Kalkbrener,et al. On the Stability of Gröbner Bases Under Specializations , 1997, J. Symb. Comput..