Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm

详细信息    查看全文

• 作者：Deepak Kapur
• 关键词：Comprehensive Gröbner basis ; minimal comprehensive Gröbner basis ; parametric polynomial system ; parametric S ; polynomial ; redundancy
• 刊名：Journal of Systems Science and Complexity
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：30
• 期：1
• 页码：196-233
• 全文大小：
• 刊物类别：Mathematics and Statistics
• 刊物主题：Systems Theory, Control; Operation Research/Decision Theory; Mathematics of Computing; Complex Systems; Statistics, general;
• 出版者：Academy of Mathematics and Systems Science, Chinese Academy of Sciences
• ISSN：1559-7067
• 卷排序：30

文摘

Gröbner basis theory for parametric polynomial ideals is explored with the main objective of mimicking the Gröbner basis theory for ideals. Given a parametric polynomial ideal, its basis is a comprehensive Gröbner basis if and only if for every specialization of its parameters in a given field, the specialization of the basis is a Gröbner basis of the associated specialized polynomial ideal. For various specializations of parameters, structure of specialized ideals becomes qualitatively different even though there are significant relationships as well because of finiteness properties. Key concepts foundational to Gröbner basis theory are reexamined and/or further developed for the parametric case: (i) Definition of a comprehensive Gröbner basis, (ii) test for a comprehensive Gröbner basis, (iii) parameterized rewriting, (iv) S-polynomials among parametric polynomials, (v) completion algorithm for directly computing a comprehensive Gröbner basis from a given basis of a parametric ideal. Elegant properties of Gröbner bases in the classical ideal theory, such as for a fixed admissible term ordering, a unique Gröbner basis can be associated with every polynomial ideal as well as that such a basis can be computed from any Gröbner basis of an ideal, turn out to be a major challenge to generalize for parametric ideals; issues related to these investigations are explored. A prototype implementation of the algorithm has been successfully tried on many examples from the literature.