Minimal canonical comprehensive Gröbner systems

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. An algorithm to obtain a canoni...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of symbolic computation Vol. 44; no. 5; pp. 463 - 478
Main Authors:	Manubens, Montserrat, Montes, Antonio
Format:	Journal Article Publication
Language:	English
Published:	Elsevier Ltd 01.05.2009
Subjects:	13 Commutative rings and algebras 13F Arithmetic rings and other special rings 13P Computational aspects of commutative algebra 68 Computer science 68W Algorithms Algorismes Algorithms Canonical Classificació AMS Commutative algebra Comprehensive Gröbner system Constructible sets Generalized canonical specification Investigació operativa Matemàtiques i estadística Minimal Programació matemàtica Reduced specification Àlgebra commutativa Àrees temàtiques de la UPC Reduced specification Generalized canonical specification Constructible sets Canonical Comprehensive Gröbner system Minimal
ISSN:	0747-7171, 1095-855X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!