Akira Suzuki
Abstract
In [5], we showed simple algorithms to compute comprehensive Gröbner systems (CGS) and comprehensive Gröbner bases (CGB). We call them Suzuki-Sato algorithms in this paper. Other known existing software packages to compute CGS or CGB are CGB of Redlog (Weispfenning) [1], DISPGB, and MCCGS (Montes) [2, 3].
- Dolzmann, A. and Sturm, T. (1997). Redlog: Computer algebra meets computer logic, ACM SIGSAM Bulletin, 31, 2, 2--9. Google Scholar
Digital Library
- Manubens, M. and Montes, A. (2004). Improving DISPGB Algorithm using the discriminant ideal, J. Symb. Comp., 41, 1245--1263.Google ScholarCross Ref
- Manubens, M. and Montes, A. (2006). Minimal Canonical Comprehensive Gröbner System, preprint MA2-IR-06-00015.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. (2006). A Simple Algorithm to Compute Comprehensive Gröbner Bases Using Gröbner Bases, International Symposium on Symbolic and Algebraic Computation (ISSAC 2006), Proceedings, 326--331. Google ScholarDigital Library
Index Terms
- Implementation of CGS and CGB on Risa/Asir and other computer algebra systems using Suzuki-Sato algorithm
Recommendations
Local Bernstein-Sato ideals: Algorithm and examples
Let k be a field of characteristic 0. Given a polynomial mapping f=(f"1,...,f"p) from k^n to k^p, the local Bernstein-Sato ideal of f at a point a@?k^n is defined as an ideal of the ring of polynomials in s=(s"1,...,s"p). We propose an algorithm for ...
Monomial Orderings, Rewriting Systems, and Gröbner Bases for the Commutator Ideal of a Free Algebra
In this paper we consider a free associative algebra on three generators over an arbitrary fieldK. Given a term ordering on the commutative polynomial ring on three variables overK, we construct uncountably many liftings of this term ordering to a ...
Comments