New order bounds in differential elimination algorithms

We present a new upper bound for the orders of derivatives in the Rosenfeld–Gröbner algorithm under weighted rankings. 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. In the case of one derivation, such a bound was given by Golubitsky et al. (2008). The only known bound in the case of several derivations was given by the authors of the present paper in 2016. The bound was achieved by associating to the algorithm antichain sequences whose lengths can be bounded using the results of León Sánchez and Ovchinnikov (2016). In the present paper, the above result by the current authors is generalized and significantly improved.