A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On the generalized Ritt problem as a computational problem

2009
*
Journal of Mathematical Sciences
*

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

doi:10.1007/s10958-009-9689-3
fatcat:4gv3j2u3crgk7gm5izny2a4zpu