Algorithms for computing greatest common divisors of parametric multivariate polynomials
DOI10.1016/j.jsc.2019.10.006zbMath1443.13023OpenAlexW2980922731MaRDI QIDQ2200294
Dong Lu, Ding-Kang Wang, Yao Sun, Deepak Kapur, Michael B. Monagan
Publication date: 19 September 2020
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2019.10.006
ideal quotientgcd systemideal intersectionminimal comprehensive Gröbner systemparametric multivariate polynomials
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (1)
Uses Software
Cites Work
- On the computation of parametric Gröbner bases for modules and syzygies
- Three new algorithms for multivariate polynomial GCD
- A new algorithm for discussing Gröbner bases with parameters.
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Canonical comprehensive Gröbner bases
- An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system
- Computing in algebraic geometry. A quick start using SINGULAR
- Stability Conditions of Monomial Bases and Comprehensive Gröbner Systems
- A new algorithm for computing comprehensive Gröbner systems
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
- The Structure of Polynomial Ideals and Gröbner Bases
- Using Algebraic Geometry
- What can be computed in algebraic geometry?
- Parametric Greatest Common Divisors using Comprehensive Gröbner Systems
- An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Algorithms for computing greatest common divisors of parametric multivariate polynomials
