This article is cited in 2 scientific papers (total in 2 papers)
On the generalized Ritt problem as a computational problem
O. D. Golubitskya, M. V. Kondrat'evab, A. I. Ovchinnikovc
a University of Western Ontario
b M. V. Lomonosov Moscow State University
c University of Illinois at Chicago
The Ritt problem asks if there is an algorithm that decides 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 whether a differential polynomial is a zero divisor modulo a radical differential ideal. The technique used in the proof of this 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.
PDF file (146 kB)
Journal of Mathematical Sciences (New York), 2009, 163:5, 515–522
O. D. Golubitsky, M. V. Kondrat'eva, A. I. Ovchinnikov, “On the generalized Ritt problem as a computational problem”, Fundam. Prikl. Mat., 14:4 (2008), 109–120; J. Math. Sci., 163:5 (2009), 515–522
Citation in format AMSBIB
\by O.~D.~Golubitsky, M.~V.~Kondrat'eva, A.~I.~Ovchinnikov
\paper On the generalized Ritt problem as a~computational problem
\jour Fundam. Prikl. Mat.
\jour J. Math. Sci.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
Harrison-Trainor M., Klys J., Moosa R., “Nonstandard Methods for Bounds in Differential Polynomial Rings”, J. Algebra, 360 (2012), 71–86
Li W., Li Y.-H., “Computation of Differential Chow Forms For Ordinary Prime Differential Ideals”, Adv. Appl. Math., 72:SI (2016), 77–112
|Number of views:|