2014/08/23 by Nazeran Idrees, Idrees, Nazeran, Afshan Sadiq +3
Computer Science · Mathematics · #13E05 #13P99 #Commutative Algebra (math.AC) #Commutative Algebra and Its Applications #FOS: Mathematics #Polynomial and algebraic computation #Rings, Modules, and Algebras
paper · pdf · doi:10.48550/arxiv.1408.5515
openalex publication_date 2014/08/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Primary decomposition is a very important tool of commutative algebra and geometry. In this paper we generalized some of the existing algorithms of primary decomposition developed by Eisenbud et al. (cf. [EHV]) for free modules and also filled some gaps by providing proofs of important theorems(2.9, 2.12, 2.13) appeared in [EHV]. All these algorithms are programmed and implemented in \sc Singular.