On the generalised Ritt problem as a computational problem

Details On the generalised Ritt problem as a computational problem On the generalised Ritt problem as a computational problem

2008-09-06

arxiv.org/abs/0809.1128v1

Mathematics

Commutative Algebra

9 pages

Scientific paper

The Ritt problem asks if there is an algorithm that tells whether one prime differential ideal is contained in another one if both are given by their characteristic sets. We give several equivalent formulations of this problem. In particular, we show that it is equivalent to testing if a differential polynomial is a zero divisor modulo a radical differential ideal. The technique used in the proof of equivalence yields algorithms for computing a canonical decomposition of a radical differential ideal into prime components and a canonical generating set of a radical differential ideal. Both proposed representations of a radical differential ideal are independent of the given set of generators and can be made independent of the ranking.

Affiliated with

Also associated with

No associations

Rating

On the generalised Ritt problem as a computational problem 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 generalised Ritt problem as a computational problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the generalised Ritt problem as a computational problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-4953