A new algorithm for computing comprehensive Gröbner systems

From MaRDI portal
Publication:2946517


DOI10.1145/1837934.1837946zbMath1321.68533MaRDI QIDQ2946517

Yao Sun, Deepak Kapur, Ding-Kang Wang

Publication date: 17 September 2015

Published in: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1837934.1837946


68W30: Symbolic computation and algebraic computation

13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)

68T45: Machine vision and scene understanding


Related Items

Decomposition of polynomial sets into characteristic pairs, Generic Gröbner basis of a parametric ideal and its application to a comprehensive Gröbner system, Distance to the loss of structural properties for linear systems under parametric uncertainties, Computing the canonical representation of constructible sets, Automatic deduction in (dynamic) geometry: Loci computation, Parametric FGLM algorithm, Algebraic local cohomology with parameters and parametric standard bases for zero-dimensional ideals, On QE algorithms over an algebraically closed field based on comprehensive Gröbner systems, Comprehensive Gröbner systems in PBW algebras, Bernstein-Sato ideals and holonomic \(D\)-modules, Computing comprehensive Gröbner systems: a comparison of two methods, Deterministic genericity for polynomial ideals, Solving the perspective-three-point problem using comprehensive Gröbner systems, Automated reducible geometric theorem proving and discovery by Gröbner basis method, Characteristic decomposition: from regular sets to normal sets, A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases, Algorithms for computing greatest common divisors of parametric multivariate polynomials, A parametric approach to 3D dynamic geometry, Generalizing the Steiner-Lehmus theorem using the Gröbner cover, On multivariate Hermitian quadratic forms, Solving parametric ideal membership problems and computing integral numbers in a ring of convergent power series via comprehensive Gröbner systems, An implementation of the Lê-Teissier method for computing local Euler obstructions, Applying Gröbner basis method to multiparametric polynomial nonlinear programming, Generic regular decompositions for generic zero-dimensional systems, Gröbner systems conversion, Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm, Multistationarity in structured reaction networks, Analyzing Boolean functions via solving parametric polynomial systems, An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form


Uses Software


Cites Work