Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cox, D., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms, 3rd edn. Springer, New York (2007)
Gonzalez–Vega, L., Traverso, C., Zanoni, A.: Hilbert stratification and parametric Gröbner bases. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2005. LNCS, vol. 3718, pp. 220–235. Springer, Heidelberg (2005)
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)
Manubens, M., Montes, A.: Minimal canonical comprehensive Gröbner systems. Journal of Symbolic Computation 44(5), 463–478 (2009)
Montes, A.: A new algorithm for discussing Gröbner bases with parameters. Journal of Symbolic Computation 33(2), 183–208 (2002)
Montes, A., Wibmer, M.: Gröbner bases for polynomial systems with parameters. Journal of Symbolic Computation 45(12), 1391–1425 (2010)
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)
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)
Suzuki, A., Sato, Y.: An alternative approach to comprehensive Gröbner bases. Journal of Symbolic Computation 36(3), 649–667 (2003)
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)
Sit, W.: Computations on Quasi-Algebraic Sets (2001)
Weispfenning, V.: Comprehensive Gröbner bases. Journal of Symbolic Computation 14(1), 1–29 (1992)
Weispfenning, V.: Canonical comprehensive Gröbner bases. Journal of Symbolic Computation 36(3), 669–683 (2003)
Wibmer, M.: Gröbner bases for families of affine or projective schemes. Journal of Symbolic Computation 42(8), 803–834 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, J., Wang, D. (2014). A Method to Determine if Two Parametric Polynomial Systems Are Equal. In: Hong, H., Yap, C. (eds) Mathematical Software – ICMS 2014. ICMS 2014. Lecture Notes in Computer Science, vol 8592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44199-2_81
Download citation
DOI: https://doi.org/10.1007/978-3-662-44199-2_81
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44198-5
Online ISBN: 978-3-662-44199-2
eBook Packages: Computer ScienceComputer Science (R0)