Show simple item record

dc.contributor.authorManubens Ferriol, Montserrat
dc.contributor.authorMontes Lozano, Antonio
dc.contributor.otherInstitut de Robòtica i Informàtica Industrial
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II
dc.date.accessioned2011-03-11T11:33:24Z
dc.date.available2011-03-11T11:33:24Z
dc.date.created2009
dc.date.issued2009
dc.identifier.citationManubens, M.; Montes, A. Minimal canonical comprehensive Gröbner systems. "Journal of symbolic computation", 2009, vol. 44, núm. 5, p. 463-478.
dc.identifier.issn0747-7171
dc.identifier.urihttp://hdl.handle.net/2117/11788
dc.description.abstractThis 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 canonical description of the segments of the Minimal Canonical CGS is given, thus completing the whole MCCGS algorithm (implemented in Maple and Singular). We show its high utility for applications, such as automatic theorem proving and discovering, and compare it with other existing methods. A way to detect a counterexample to deny its existence is outlined, although the high number of tests done give evidence of the existence of the Minimal Canonical CGS.
dc.format.extent16 p.
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Programació matemàtica
dc.subject.lcshAlgorithms
dc.subject.lcshCommutative algebra
dc.titleMinimal canonical comprehensive Gröbner systems
dc.typeArticle
dc.subject.lemacAlgorismes
dc.subject.lemacÀlgebra commutativa
dc.contributor.groupUniversitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
dc.identifier.doi10.1016/j.jsc.2007.07.022
dc.subject.amsClassificació AMS::68 Computer science::68W Algorithms
dc.subject.amsClassificació AMS::13 Commutative rings and algebras::13P Computational aspects of commutative algebra
dc.subject.amsClassificació AMS::13 Commutative rings and algebras::13F Arithmetic rings and other special rings
dc.rights.accessOpen Access
local.identifier.drac5330836
dc.description.versionPostprint (published version)
local.citation.authorManubens, M.; Montes, A.
local.citation.publicationNameJournal of symbolic computation
local.citation.volume44
local.citation.number5
local.citation.startingPage463
local.citation.endingPage478


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain