Completing parametric unimodular rows to unimodular matrices
From MaRDI portal
Cites work
- A new algorithm for computing comprehensive Gröbner systems
- 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
- Algorithms for computing a primary ideal decomposition without producing intermediate redundant components
- Algorithms for computing greatest common divisors of parametric multivariate polynomials
- Algorithms for the Quillen-Suslin theorem
- An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system
- An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
- An extended GCD algorithm for parametric univariate polynomials and application to parametric smith normal form
- Automated Deduction in Geometry
- Automatic Discovery of Geometry Theorems Using Minimal Canonical Comprehensive Gröbner Systems
- Comprehensive Gröbner bases
- Faisceaux algébriques cohérents
- Localization and primary decomposition of polynomial ideals
- Modular algorithms for computing minimal associated primes and radicals of polynomial ideals
- On Serre's Problem on Projective Modules
- On the stability of Gröbner bases under specializations
- Projective modules over polynomial rings
- The Quillen - Suslin theorem and the structure of n-dimensional elementary polynomial matrices
This page was built for publication: Completing parametric unimodular rows to unimodular matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288980)
