An algorithm to compute a primary decomposition of modules in polynomial rings over the integers

DOI10.1556/SScMath.52.2015.1.1296zbMath1349.13058arXiv1408.4343OpenAlexW2022019103MaRDI QIDQ5248388

Gerhard Pfister, Afshan Sadiq, Nazeran Idrees

Publication date: 7 May 2015

Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.4343

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) Computational aspects and applications of commutative rings (13P99) Commutative Noetherian rings and modules (13E05)

Related Items (3)

Primary decomposition of modules: a computational differential approach ⋮ F. S. Macaulay: From plane curves to Gorenstein rings ⋮ primdecint.lib

Uses Software

• SINGULAR

This page was built for publication: An algorithm to compute a primary decomposition of modules in polynomial rings over the integers