An algorithm to compute the kernel of a derivation up to a certain degree

Stefan Maubach. "An algorithm to compute the kernel of a derivation up to a certain degree." Annales Polonici Mathematici 76.1-2 (2001): 147-158. <http://eudml.org/doc/281098>.

@article{StefanMaubach2001,
abstract = {An algorithm is described which computes generators of the kernel of derivations on k[X₁,...,Xₙ] 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.},
author = {Stefan Maubach},
journal = {Annales Polonici Mathematici},
keywords = {polynomial ring; kernel of derivation; grading},
language = {eng},
number = {1-2},
pages = {147-158},
title = {An algorithm to compute the kernel of a derivation up to a certain degree},
url = {http://eudml.org/doc/281098},
volume = {76},
year = {2001},
}

TY - JOUR
AU - Stefan Maubach
TI - An algorithm to compute the kernel of a derivation up to a certain degree
JO - Annales Polonici Mathematici
PY - 2001
VL - 76
IS - 1-2
SP - 147
EP - 158
AB - An algorithm is described which computes generators of the kernel of derivations on k[X₁,...,Xₙ] 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.
LA - eng
KW - polynomial ring; kernel of derivation; grading
UR - http://eudml.org/doc/281098
ER -