Abstract

Comprehensive Grobner bases for parametric polynomial ideals were introduced, constructed, and studied by the author in 1992. Since then the construction has been implemented in the computer algebra systems ALDES/SAC-2, MAS, REDUCE and MAPLE. A comprehensive Grobner basis is a finite subset G of a parametric polynomial ideal I such that σ(G) constitutes a Grobner basis of the ideal generated by σ(I) under all specializations σ of the parameters in arbitrary fields. This concept has found numerous applications. In contrast to reduced Grobner bases, however, no concept of a canonical comprehensive Grobner basis was known that depends only on the ideal and the term order. In this note we find such a concept under very general assumptions on the parameter ring. After proving the existence and essential uniqueness of canonical comprehensive Grobner bases in a non-constructive way, we provide a corresponding construction for the classical case, where the parameter ring is a multivariate polynomial ring. It proceeds via the construction of a canonical faithful Grobner system. Some simple examples illustrate the features of canonical comprehensive Grobner bases. Besides their theoretical importance, canonical comprehensive Grobner bases are also of potential interest for efficiency reasons as indicated by the research of A. Montes.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.