Algorithm for primary submodule decomposition without producing intermediate redundant components
From MaRDI portal
Recommendations
- Algorithms for primary decomposition of modules
- An algorithm to compute a primary decomposition of modules in polynomial rings over the integers
- Primary decomposition of modules: Two variables over a field
- Gröbner bases and primary decomposition of modules
- Primary decomposition of modules: a computational differential approach
Cites work
- Algorithms for computing a primary ideal decomposition without producing intermediate redundant components
- Algorithms for primary decomposition of modules
- Direct methods for primary decomposition
- Gröbner bases and primary decomposition of modules
- Gröbner bases and primary decomposition of polynomial ideals
- Localization and primary decomposition of polynomial ideals
Cited in
(6)- Efficient localization at a prime ideal without producing unnecessary primary components
- Primary decomposition of modules: a computational differential approach
- Primary decomposition of modules: Two variables over a field
- Algorithms for primary decomposition of modules
- Primary decomposition of submodules of a finitely generated module over a PID
- An algorithm for primary decomposition in polynomial rings over the integers
This page was built for publication: Algorithm for primary submodule decomposition without producing intermediate redundant components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5383834)
