An Algorithm to Compute the Kernel of a Derivation up to a Certain Degree

An algorithm is described which computes generators of the kernel of derivations on k[ X1, . . . , Xn] up to a previously given bound. For w -homogeneous derivations it is shown that if the algorithm computes a generating set for the kernel, then this set is minimal.