Gröbner bases for polynomial systems with parameters

  • Authors:

  • Antonio Montes;Michael Wibmer

  • Affiliations:

  • Universitat Politècnica de Catalunya, Matematica Aplicada 2, c/ Jordi Girona 1-3, E08034 Barcelona, Spain;IWR, Universität Heidelberg, Germany

  • Venue:
  • Journal of Symbolic Computation
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Grobner bases are the computational method par excellence for studying polynomial systems. In the case of parametric polynomial systems one has to determine the reduced Grobner basis in dependence of the values of the parameters. In this article, we present the algorithm GrobnerCover which has as inputs a finite set of parametric polynomials, and outputs a finite partition of the parameter space into locally closed subsets together with polynomial data, from which the reduced Grobner basis for a given parameter point can immediately be determined. The partition of the parameter space is intrinsic and particularly simple if the system is homogeneous.