Implementation of a primary decomposition package

DOI10.1142/9789814383462_0013MaRDI QIDQ2812499zbMATH OpenOpenAlexFDO

Authors Masayuki Noro

Publication date 16 June 2016

Published in Harmony of Gröbner Bases and the Modern Industrial Society - The Second CREST-CSBM International Conference (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Ideals and multiplicative ideal theory in commutative rings (13A15) Software, source code, etc. for problems pertaining to commutative algebra (13-04)

Recommendations

• An algorithm for primary decomposition in polynomial rings over the integers
• Algorithms for primary decomposition of modules
• A new approach to primary decomposition
• Algorithms for computing a primary ideal decomposition without producing intermediate redundant components
• New algorithms for computing primary decomposition of polynomial ideals

Cited in

(2)

• noro_pd
• Algorithms for computing a primary ideal decomposition without producing intermediate redundant components

Describes a project that uses

Uses Software

• OpenXM
• Risa/Asir

This page was built for publication: Implementation of a primary decomposition package

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