On Computation of Kolchin Characteristic Sets: Ordinary and Partial Cases

Details On Computation of Kolchin Characteristic Sets: Ordinary and Partial Cases On Computation of Kolchin Characteristic Sets: Ordinary and Partial Cases

2006-06-06

arxiv.org/abs/math/0606124v2

Mathematics

Commutative Algebra

Minor changes

Scientific paper

In this paper we study the problem of computing a Kolchin characteristic set of a radical differential ideal. The central part of the article is the presentation of algorithms solving this problem in two principal cases: for ordinary differential polynomials and in the partial differential case. Our computations are mainly performed with respect to orderly rankings. We also discuss the usefulness of regular and characteristic decompositions of radical differential ideals. In the partial differential case we give an algorithm for computing characteristic sets in the special case of radical differential ideals satisfying the property of consistency. For this class of ideals we show how to deal with arbitrary differential rankings.

Affiliated with

Also associated with

No associations

Rating

On Computation of Kolchin Characteristic Sets: Ordinary and Partial Cases 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 Computation of Kolchin Characteristic Sets: Ordinary and Partial Cases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Computation of Kolchin Characteristic Sets: Ordinary and Partial Cases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-3306