On Computation of Kolchin Characteristic Sets: Ordinary and Partial Cases
| dc.creator | Kondratieva, Marina | |
| dc.creator | Ovchinnikov, Alexey | |
| dc.date | 2006-06-06 | |
| dc.date | 2006-06-12 | |
| dc.date.accessioned | 2026-07-07T07:16:57Z | |
| dc.date.available | 2026-07-07T07:16:57Z | |
| dc.description | 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. | |
| dc.description | Minor changes | |
| dc.identifier | https://arxiv.org/abs/math/0606124 | |
| dc.identifier | http://arxiv.org/abs/math/0606124 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/113779 | |
| dc.subject | Commutative Algebra | |
| dc.subject | 12H05; 13N10; 13P10 | |
| dc.title | On Computation of Kolchin Characteristic Sets: Ordinary and Partial Cases | |
| dc.type | text |