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

DOI10.1556/SSCMATH.52.2015.1.1296MaRDI QIDQ5248388zbMATH OpenOpenAlexFDO

Authors Nazeran Idrees, Gerhard Pfister, Afshan Sadiq

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

associated primesextractionGröbner baseslocalizationprimary decompositionprimary modulespseudo primary

Mathematics Subject Classification ID

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

Abstract: We present an algorithm to compute the primary decomposition of a submodule $mathcalN$ of the free module $$. For this purpose we use algorithms for primary decomposition of ideals in the polynomial ring over the integers. The idea is to compute first the minimal associated primes of $mathcalN$, i.e. the minimal associated primes of the ideal $$ in $$ and then compute the primary components using pseudo-primary decomposition and extraction, following the ideas of Shimoyama-Yokoyama. The algorithms are implemented in {sc Singular}.

Recommendations

• An algorithm for primary decomposition in polynomial rings over the integers
• Algorithms for primary decomposition of modules
• New algorithms for computing primary decomposition of polynomial ideals
• Primary decomposition of modules over Dedekind domains using Gröbner bases
• scientific article; zbMATH DE number 1532177
• Modular algorithms for computing minimal associated primes and radicals of polynomial ideals
• Primary decomposition of modules: a computational differential approach
• On decomposition of polynomials over rings
• Primal decomposition in rings, modules and lattice modules
• scientific article; zbMATH DE number 1383108

Cited in

(7)

• Primary decomposition of modules: a computational differential approach
• The multiplicity problem for indecomposable decompositions of modules over a finite-dimensional algebra. Algorithms and a computer algebra approach
• primdecint.lib
• Algorithms for primary decomposition of modules
• Algorithm for primary submodule decomposition without producing intermediate redundant components
• F. S. Macaulay: From plane curves to Gorenstein rings
• An algorithm for primary decomposition in polynomial rings over the integers

Describes a project that uses

Uses Software

• SINGULAR

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

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