On the computation of parametric Gröbner bases for modules and syzygies

DOI10.1007/S13160-010-0003-ZzbMATH Open1204.13019OpenAlexW1994234357MaRDI QIDQ623733FDOQ623733

Authors Katsusuke Nabeshima

Publication date 8 February 2011

Published in Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s13160-010-0003-z

zbMATH Keywords

modulessyzygiescomprehensive\texttt{Risa/Asir}Gröbner bases

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Syzygies, resolutions, complexes and commutative rings (13D02) Software, source code, etc. for problems pertaining to commutative algebra (13-04)

Recommendations

• Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm
• scientific article; zbMATH DE number 2195269
• Parametric FGLM algorithm
• Comprehensive Gröbner bases
• Gröbner bases for polynomial systems with parameters

Cites work

• scientific article; zbMATH DE number 1726532 (Why is no real title available?)
• scientific article; zbMATH DE number 3941661 (Why is no real title available?)
• scientific article; zbMATH DE number 1120551 (Why is no real title available?)
• scientific article; zbMATH DE number 2133397 (Why is no real title available?)
• scientific article; zbMATH DE number 2151243 (Why is no real title available?)
• A new algorithm for discussing Gröbner bases with parameters.
• A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
• A speed-up of the algorithm for computing comprehensive Gröbner systems
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• An alternative approach to comprehensive Gröbner bases
• Comprehensive Gröbner bases
• Computer Algebra in Scientific Computing
• Improving the DISPGB algorithm using the discriminant ideal
• New constructive methods in classical ideal theory
• On Gröbner bases under specialization
• On systems of algebraic equations with parametric exponents
• On systems of algebraic equations with parametric exponents. II
• On the stability of Gröbner bases under specializations
• Properties of Gröbner bases under specializations
• Reduced Gröbner bases in polynomial rings over a polynomial ring
• Solving systems of algebraic equations by using Gröbner bases
• Stability of parametric decomposition
• Uniform Gröbner bases for ideals generated by polynomials with parametric exponents

Cited in

(14)

• Generalized Integral Dependence Relations
• scientific article; zbMATH DE number 5117360 (Why is no real title available?)
• Testing zero-dimensionality of varieties at a point
• Computing with parameterized varieties
• Testing flatness and computing rank of a module using syzygies
• A new algorithm for computing logarithmic vector fields along an isolated singularity and Bruce-Roberts Milnor ideals
• Equations of Riemann surfaces with automorphisms
• Computing H-bases via minimal bases for syzygy modules
• Algorithms for computing greatest common divisors of parametric multivariate polynomials
• An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form
• Gröbner bases for syzygy modules of border bases
• Erratum to ``A new algorithm for discussing Gröbner bases with parameters [J. Symbolic Comput. 33 (1-2) (2002) 183-208]
• A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimension
• Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm

Describes a project that uses

Uses Software

• dpgb
• PGB
• Risa/Asir
• SINGULAR
• REDLOG

This page was built for publication: On the computation of parametric Gröbner bases for modules and syzygies

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