Minimal canonical comprehensive Gröbner systems

Article English OPEN
Manubens, Montserrat; Montes, Antonio;
(2009)
  • Publisher: Elsevier BV
  • Journal: Journal of Symbolic Computation,volume 44,issue 5,pages463-478 (issn: 0747-7171)
  • Related identifiers: doi: 10.1016/j.jsc.2007.07.022
  • Subject: Algorithms | Computational Mathematics | Algorismes | Algebra and Number Theory | Àlgebra commutativa | :Matemàtiques i estadística::Investigació operativa::Programació matemàtica [Àrees temàtiques de la UPC] | Commutative algebra | :13 Commutative rings and algebras::13P Computational aspects of commutative algebra [Classificació AMS] | :13 Commutative rings and algebras::13F Arithmetic rings and other special rings [Classificació AMS] | :68 Computer science::68W Algorithms [Classificació AMS]
    acm: ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION

This is the continuation of Montes' paper "On the canonical discussion of polynomial systems with parameters''. In this paper, we define the Minimal Canonical Comprehensive Gröbner System of a parametric ideal and fix under which hypothesis it exists and is computable. ... View more
Share - Bookmark