Akira Suzuki
ABSTRACT
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.
- Becker, T. (1994). On gröbner bases under specialization. Applicable Algebra in Engineering, Communication and Computing, 5, 1--8.Google Scholar
Cross Ref
- Becker, T. and Weispfenning, V. (1993). Gröbner Bases-A Computational Approach to Commutative Algebra-, Springer-Verlag. Google ScholarDigital Library
- Dolzmann, A. and Sturm, T. (1997). Redlog: Computer algebra meets computer logic, ACM SIGSAM Bulletin, 31, 2, 2--9. Google ScholarDigital Library
- Kalkbrener, K. (1997). On the stability of gröbner bases under specialization, J. Symb. Comp. 24, 1, 51--58. Google ScholarDigital Library
- Montes, A. (2002). A new algorithm for discussing Gröbner basis with parameters, J. Symb. Comp. 33, 1--2, 183--208. Google ScholarDigital Library
- Manubens, M. and Montes, A. (2005). Improving DISPGB Algorithm Using the Discriminant Ideal, J. Symb. Comp., A3L 2005 special issue, to appear.Google Scholar
- Noro, M. and Takeshima, T. (1992). Risa/Asir - A Computer Algebra System. International Symposium on Symbolic and Algebraic Computation (ISSAC 92), Proceedings, 387--396. Google ScholarDigital Library
- Suzuki, A. and Sato, Y. (2002). An Alternative approach to Comprehensive Gröbner Bases. International Symposium on Symbolic and Algebraic Computation (ISSAC 2002), Proceedings, 255--261. Google ScholarDigital Library
- Suzuki, A. and Sato, Y. (2003). An Alternative approach to Comprehensive Gröbner Bases. J. Symb. Comp. 36/3-4, 649--667. Google ScholarDigital Library
- Weispfenning, V. (1992). Comprehensive Gröbner bases, J. Symb. Comp. 14/1, 1--29. Google ScholarDigital Library
- Weispfenning, V. (2003). Canonical Comprehensive Gröbner bases, J. Symb. Comp. 36, 669--683. Google ScholarDigital Library
Index Terms
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
Recommendations
An efficient method for computing comprehensive Gröbner bases
A new approach is proposed for computing a comprehensive Grobner basis of a parameterized polynomial system. The key new idea is not to simplify a polynomial under various specialization of its parameters, but rather keep track in the polynomial, of the ...
A combinatorial result on Gröbner Fans with an application to universal Gröbner bases
We prove a regularity theorem on the Gröbner Fan of a polynomial ideal, and apply the regularity to obtain a `filling algorithm' for the direct enumeration of all the reduced Gröbner bases of the ideal.
An alternative approach to comprehensive Gröbner bases
Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)We give an alternative definition of comprehensive Gröbner bases in terms of Gröbner bases in polynomial rings over commutative Von Neumann regular rings. Our comprehensive Gröbner bases are defined as Gröbner bases in polynomial rings over certain ...
Comments