Minimal primary decomposition and factorized Gröbner bases

DOI10.1007/S002000050064zbMATH Open1055.13501OpenAlexW1978771104MaRDI QIDQ1361005FDOQ1361005

Hans-Gert Gräbe

Publication date: 1997

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://ul.qucosa.de/id/qucosa%3A32790

Recommendations

• Gröbner bases and primary decomposition of polynomial ideals
• Gröbner bases and primary decomposition of modules
• Algorithms for primary decomposition of modules
• Algorithms for computing a primary ideal decomposition without producing intermediate redundant components

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Grammars and rewriting systems (68Q42)

Cited In (8)

• Minimal basis of the syzygy module of leading terms
• On the structure of ideals in a family of skew polynomial rings
• Syzygies probing scattering amplitudes
• A signature-based algorithm for computing the nondegenerate locus of a polynomial system
• Primary decomposition of zero-dimensional ideals over finite fields
• Normal projection: deterministic and probabilistic algorithms
• On computing absolutely irreducible components of algebraic varieties with parameters
• The decision of prime and primary ideal

Uses Software

• REDUCE
• CALI

This page was built for publication: Minimal primary decomposition and factorized Gröbner bases

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