A procedure to compute prime filtration

DOI10.2478/S11533-009-0073-9zbMATH Open1184.13068OpenAlexW1973517208MaRDI QIDQ2379264FDOQ2379264

Authors: A. Rauf 

Publication date: 19 March 2010

Published in: Central European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/s11533-009-0073-9

Recommendations

• Prime filtrations of the powers of an ideal
• Associated prime filtrations of finitely generated modules over noetherian rings
• Algorithms for primary decomposition of modules
• Prime filtrations and primary decompositions of modules
• Mora's holy graal: algorithms for computing in localizations at prime ideals

zbMATH Keywords

monomial idealStanley decompositionprime filtrations

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Special types (Cohen-Macaulay, Gorenstein, Buchsbaum, etc.) (13H10) Dimension theory, depth, related commutative rings (catenary, etc.) (13C15)

Cites Work

• A Singular Introduction to Commutative Algebra
• SINGULAR
• Title not available (Why is that?)
• How to compute the Stanley depth of a monomial ideal
• Finite filtrations of modules and shellable multicomplexes
• Depth and Stanley Depth of Multigraded Modules
• Stanley Decompositions, Pretty Clean Filtrations and Reductions Modulo Regular Elements
• Prime filtrations of monomial ideals and polarizations

Uses Software

• SINGULAR

This page was built for publication: A procedure to compute prime filtration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379264)