Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:5890234
Jump to:navigation, search

DOI10.4064/ap76-1-15zbMath0978.13015OpenAlexW2017370699MaRDI QIDQ5890234

Stefan Maubach

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


zbMATH Keywords

polynomial ringgradingkernel of derivation


Mathematics Subject Classification ID

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5890234&oldid=15583173"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 13:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki