Characterization of relative Gröbner bases (Q390387): Difference between revisions

Gröbner bases are one of the most important concepts in Computational Algebra. They have many applications and allow to make several computations in polynomial rings. \textit{M. Zhou} and \textit{F. Winkler} [J. Symb. Comput. 43, No. 10, 726--745 (2008; Zbl 1149.13014)] introduced the concept of \textit{relative Gröbner bases}, together with the notion of \textit{relative reduction}. These ideas are strictly related to the one of Gröbner basis w.r.t. several term orderings, due to \textit{A. B. Levin} [J. Symb. Comput. 42, No. 5, 561--578 (2007; Zbl 1144.13013)]. In this paper, the author provides results that complete the theory of relative Gröbner bases by Zhou and Winkler, such as a characterization for relative Gröbner bases and the conditions on the leading terms s.t. a relative Gröbner basis is not changed by a change of term ordering. He analyzes the algorithm for the computation of relative Gröbner bases proposed by Zhou and Winkler, focusing on the problem of termination and providing an example of non-termination.