Gröbner bases for polynomial systems with parameters (Q607062)

Since several years Gröbner bases play an important role to study polynomial systems. The main purpose of this article is to determine the reduced Gröbner basis of an ideal generated by parametric polynomials, independent of the values of the parameters. For this purpose, the authors presented the so-called \texttt{GRÖBNERCOVER} algorithm. For a finite set of parametric polynomials as an input, this algorithm computes a finite partition of parameter space into locally closed subsets together with certain polynomial data, from which the reduced Gröbner basis for each parameter point can be determined. If the given system of parametric polynomials is homogeneous, then the partition of the parameter space is simple and intrinsic. The \texttt{GRÖBNERCOVER} algorithm is implemented in the computer algebra system \texttt{SINGULAR}.