Research Training Network in Model Theory
Publications > Preprint server > Preprint Number 1000

Preprint Number 1000

Previous Next Preprint server

1000. Richard Gustavson, Alexey Ovchinnikov, and Gleb Pogudin
Bounds for orders of derivatives in differential elimination algorithms

Submission date: 31 January 2016.


We compute an upper bound for the orders of derivatives in the Rosenfeld-Groebner algorithm. This algorithm computes a regular decomposition of a radical differential ideal in the ring of differential polynomials over a differential field of characteristic zero with an arbitrary number of commuting derivations. This decomposition can then be used to test for membership in the given radical differential ideal. In particular, this algorithm allows us to determine whether a system of polynomial PDEs is consistent. Previously, the only known order upper bound was given by Golubitsky, Kondratieva, Moreno Maza, and Ovchinnikov for the case of a single derivation.
We achieve our bound by associating to the algorithm antichain sequences whose lengths can be bounded using the results of Leon Sanchez and Ovchinnikov.

Mathematics Subject Classification: 12H05, 12H20, 14Q20

Keywords and phrases:

Full text arXiv 1602.00246: pdf, ps.

Last updated: February 12 2016 17:18 Please send your corrections to: