A Method to Determine if Two Parametric Polynomial Systems Are Equal
The comprehensive Gröbner systems of parametric polynomial ideal were first introduced by Volker Weispfenning. Since then, many improvements have been made to improve these algorithms to make them useful for different applications. In contract to reduced Groebner bases, which is uniquely determined by the polynomial ideal and the term ordering, however, comprehensive Groebner systems do not have such a good property. Different algorithm may give different results even for a same parametric polynomial ideal. In order to treat this issue, we give a decision method to determine whether two comprehensive Groebner systems are equal. The polynomial ideal membership problem has been solved for the non-parametric case by the classical Groebner bases method, but there is little progress on this problem for the parametric case until now. An algorithm is given for solving this problem through computing comprehensive Groebner systems. What’s more, for two parametric polynomial ideals and a constraint over the parameters defined by a constructible set, an algorithm will be given to decide whether one ideal contains the other under the constraint.
KeywordsConstructible Set Quasi-algebraic set Gröbner Bases Comprehensive Gröbner System
Unable to display preview. Download preview PDF.
- 3.Kapur, D., Sun, Y., Wang, D.K.: A new algorithm for computing comprehensive Gröbner systems. In: Proc. ISSAC 2010, pp. 29–36. ACM Press, New York (2010)Google Scholar
- 7.Nabeshima, K.: A speed-up of the algorithm for computing comprehensive Gröbner systems. In: Proc. ISSAC 2010, pp. 299–306. ACM Press, New York (2007)Google Scholar
- 8.Sato, Y., Suzuki, A.: Computation of inverses in residue class rings of parametric polynomial ideal. In: Proc. ISSAC 2009, pp. 311–316. ACM Press, New York (2009)Google Scholar
- 10.Suzuki, A., Sato, Y.: A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases. In: Proc. ISSAC 2006, pp. 326–331. ACM Press, New York (2006)Google Scholar
- 11.Sit, W.: Computations on Quasi-Algebraic Sets (2001)Google Scholar