A bound for the Rosenfeld-Gröbner algorithm (Q928772)

The Rosenfeld-Gröbner algorithm, proposed in [\textit{F. Boulier, D. Lazard, F. Ollivier} and \textit{M. Petitot}, Computing representations for radicals of finitely generated differential ideals (Tech. Rep. IT306, Université Lille I, LIFL, 59655, Villeneuve d'Ascq, France) (1997)], decomposes radical differential ideals into regular components. The authors propose a modification of it which allows them to bound the orders of the intermediate differential polynomials in the computation. Since regular ideals can be decomposed into characterizable components algebraically, the bound also holds for the orders of derivatives occurring in a characteristic decomposition of a radical differential ideal.