Algorithm for primary submodule decomposition without producing intermediate redundant components

DOI10.1142/S0219498819500609zbMath1412.13029OpenAlexW2797658274WikidataQ129982427 ScholiaQ129982427MaRDI QIDQ5383834

Afshan Sadiq

Publication date: 20 June 2019

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219498819500609

zbMATH Keywords

Gröbner basesassociated primeslocalizationprimary decompositionextractionprimary modulespseudo primary

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Commutative Noetherian rings and modules (13E05)

Uses Software

• SINGULAR
• primdecSYCI.lib
• syci.m2

Cites Work

• Localization and primary decomposition of polynomial ideals
• Algorithms for computing a primary ideal decomposition without producing intermediate redundant components
• Gröbner bases and primary decomposition of polynomial ideals
• Direct methods for primary decomposition
• Gröbner bases and primary decomposition of modules
• Algorithms for primary decomposition of modules

This page was built for publication: Algorithm for primary submodule decomposition without producing intermediate redundant components