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
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
- Title not available (Why is that?)
- Comprehensive Gröbner bases
- A new algorithm for discussing Gröbner bases with parameters.
- An alternative approach to comprehensive Gröbner bases
- Uniform Gröbner bases for ideals generated by polynomials with parametric exponents
- On systems of algebraic equations with parametric exponents
- Computer Algebra in Scientific Computing
- Properties of Gröbner bases under specializations
- New constructive methods in classical ideal theory
- Title not available (Why is that?)
- Improving the DISPGB algorithm using the discriminant ideal
- A speed-up of the algorithm for computing comprehensive Gröbner systems
- On Gröbner bases under specialization
- On the stability of Gröbner bases under specializations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving systems of algebraic equations by using Gröbner bases
- Stability of parametric decomposition
- Reduced Gröbner bases in polynomial rings over a polynomial ring
- On systems of algebraic equations with parametric exponents. II
Cited In (13)
- Erratum to ``A new algorithm for discussing Gröbner bases with parameters [J. Symbolic Comput. 33 (1-2) (2002) 183-208]
- Equations of Riemann surfaces with automorphisms
- Testing zero-dimensionality of varieties at a point
- Gröbner bases for syzygy modules of border bases
- A new algorithm for computing logarithmic vector fields along an isolated singularity and Bruce-Roberts Milnor ideals
- Computing with parameterized varieties
- An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form
- Computing H-bases via minimal bases for syzygy modules
- Title not available (Why is that?)
- Testing flatness and computing rank of a module using syzygies
- A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimension
- Algorithms for computing greatest common divisors of parametric multivariate polynomials
- Generalized Integral Dependence Relations
Uses Software
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)
