Generic Gröbner basis of a parametric ideal and its application to a comprehensive Gröbner system (Q6139279)

In this paper, the properties of generic Gröbner bases for parametric polynomial ideals and their application in the construction of comprehensive Gröbner systems are discussed. Let \(t = \{t_1,\ldots, t_m\}\) be a set of parameters and \(x = \{x_1,\ldots, x_n\}\) a set of variables. Moreover, let \(K\) be a field of characteristic zero. Finally, let \(F\subset K[t][x]\) be a set of parametric polynomials. The aim of this paper is to find a parametric Gröbner basis for the ideal generated by \(F\). For this purpose, the author first computes a generic Gröbner basis \(G\) for \(F\) as ideal in \(K(t)[x]\). Then, from the set \(G\) a branch of the comprehensive Gröbner system of \(\langle F \rangle\) is produced. This means a set of null and not-null conditions such that for each \(m\)-tuple \(\sigma=(\sigma_1,\ldots ,\sigma_m)\in K^m\) satisfying the conditions, \(G_\sigma\) becomes a Gröbner basis for \(\langle F\rangle\) in \(K[x]\). The construction of a full comprehensive Gröbner basis continues by creating other branches. An algorithm based on this discussion has been implemented in the computer algebra system Risa/Asir and compared with the Kapur-Sun-Wang algorithm. The results show that the new algorithm performs better on some of the examples.