Minimal Canonical Comprehensive Groebner Systems

Details Minimal Canonical Comprehensive Groebner Systems Minimal Canonical Comprehensive Groebner Systems

2006-11-30

arxiv.org/abs/math/0611948v2

Mathematics

Commutative Algebra

23 pages, 7 figures. New version

Scientific paper

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 Groebner System (MCCGS) 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 MCCGS is given, completing so the whole MCCGS algorithm (implemented in Maple). We show its high utility for applications, like automatic theorem proving and discovering, and compare it with other existing methods. A way to detect a counterexample is outlined, although the high number of tests done give evidence of the existence of the MCCGS.

Affiliated with

Also associated with

No associations

Rating

Minimal Canonical Comprehensive Groebner Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimal Canonical Comprehensive Groebner Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimal Canonical Comprehensive Groebner Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-423079