An algorithm to compute the kernel of a derivation up to a certain degree
From MaRDI portal
Publication:5890234
DOI10.4064/ap76-1-15zbMath0978.13015OpenAlexW2017370699MaRDI QIDQ5890234
Publication date: 9 July 2001
Published in: Annales Polonici Mathematici (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/ap76-1-15
Computational aspects and applications of commutative rings (13P99) Graded rings (13A02) Derivations and commutative rings (13N15) Morphisms of commutative rings (13B10) Commutative rings and modules of finite generation or presentation; number of generators (13E15)
Related Items (1)
Triangular monomial derivations on \(k[X_1,X_2,X_3,X_4\) have kernel generated by at most four elements]
This page was built for publication: An algorithm to compute the kernel of a derivation up to a certain degree