On the canonical discussion of polynomial systems with parameters

Details On the canonical discussion of polynomial systems with parameters On the canonical discussion of polynomial systems with parameters

2006-01-27

arxiv.org/abs/math/0601674v6

Mathematics

Commutative Algebra

19 pages, 2 figures. See also http://www-ma2.upc.edu/~montes/ . Complete new version

Scientific paper

Given a parametric polynomial ideal I, the algorithm DISPGB, introduced by the author in 2002, builds up a binary tree describing a dichotomic discussion of the different reduced Groebner bases depending on the values of the parameters, whose set of terminal vertices form a Comprehensive Groebner System (CGS). It is relevant to obtain CGS's having further properties in order to make them more useful for the applications. In this paper the interest is focused on obtaining a canonical CGS. We define the objective, show the difficulties and formulate a natural conjecture. If the conjecture is true then such a canonical CGS will exist and can be computed. We also give an algorithm to transform our original CGS in this direction and show its utility in applications.

Affiliated with

Also associated with

No associations

Rating

On the canonical discussion of polynomial systems with parameters 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 On the canonical discussion of polynomial systems with parameters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the canonical discussion of polynomial systems with parameters will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-506163