A new algorithm for computing comprehensive Gröbner systems
From MaRDI portal
Publication:2946517
DOI10.1145/1837934.1837946zbMath1321.68533OpenAlexW2103185909MaRDI 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
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Machine vision and scene understanding (68T45)
Related Items (28)
Gröbner systems conversion ⋮ Computing the canonical representation of constructible sets ⋮ Comprehensive Gröbner systems in PBW algebras, Bernstein-Sato ideals and holonomic \(D\)-modules ⋮ Computing comprehensive Gröbner systems: a comparison of two methods ⋮ Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm ⋮ Analyzing Boolean functions via solving parametric polynomial systems ⋮ Deterministic genericity for polynomial ideals ⋮ Automatic deduction in (dynamic) geometry: Loci computation ⋮ An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form ⋮ Multistationarity in structured reaction networks ⋮ Solving the perspective-three-point problem using comprehensive Gröbner systems ⋮ 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 ⋮ Algorithms for computing greatest common divisors of parametric multivariate polynomials ⋮ 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 ⋮ A parametric approach to 3D dynamic geometry ⋮ Generalizing the Steiner-Lehmus theorem using the Gröbner cover ⋮ Parametric FGLM algorithm ⋮ Algebraic local cohomology with parameters and parametric standard bases for zero-dimensional ideals ⋮ Decomposition of polynomial sets into characteristic pairs ⋮ On QE algorithms over an algebraically closed field based on comprehensive Gröbner systems ⋮ 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
Uses Software
Cites Work
- Differential algebra for derivations with nontrivial commutation rules
- Generating differential invariants
- Projective-type differential invariants and geometric curve evolutions of KdV-type in flat homogeneous manifolds
- Smooth and algebraic invariants of a group action: Local and global constructions
- Differential invariants of a Lie group action: syzygies on a generating set
- Invariants différentiels d'un pseudogroupe de Lie. I
- Invariants différentiels d'un pseudogroupe de Lie. II
- Higher order contact of submanifolds of homogeneous spaces
- Moving coframes. II: Regularization and theoretical foundations
- Rational invariants of a group action. Construction and rewriting
- Differential invariants of conformal and projective surfaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A new algorithm for computing comprehensive Gröbner systems
