A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
From MaRDI portal
Publication:2959007
DOI10.1145/1145768.1145821zbMath1356.13040OpenAlexW2045154989MaRDI QIDQ2959007
Publication date: 3 February 2017
Published in: Proceedings of the 2006 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1145768.1145821
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (32)
An improvement of the rational representation for high-dimensional systems ⋮ Gröbner systems conversion ⋮ First order perturbation and local stability of parametrized 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 ⋮ Stability analysis for discrete biological models using algebraic methods ⋮ Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm ⋮ Gröbner bases for polynomial systems with parameters ⋮ Automatic deduction in (dynamic) geometry: Loci computation ⋮ An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form ⋮ On the computation of parametric Gröbner bases for modules and syzygies ⋮ Generic Gröbner basis of a parametric ideal and its application to a comprehensive Gröbner system ⋮ On the computation of the Galois group of linear difference equations ⋮ Algorithms for computing greatest common divisors of parametric multivariate polynomials ⋮ Generic regular decompositions for parametric polynomial systems ⋮ Boolean Gröbner bases ⋮ CGSQE/SyNRAC ⋮ A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases ⋮ Generalizing the Steiner-Lehmus theorem using the Gröbner cover ⋮ Gröbner bases for families of affine or projective schemes ⋮ Parametric FGLM algorithm ⋮ Deterministic normal position transformation and its applications ⋮ On the Computation of Elimination Ideals of Boolean Polynomial Rings ⋮ Minimal canonical comprehensive Gröbner systems ⋮ On QE algorithms over an algebraically closed field based on comprehensive Gröbner systems ⋮ On the Implementation of CGS Real QE ⋮ Parametric polynomial spectral factorization using the sum of roots and its application to a control design problem ⋮ On the Computation of Comprehensive Boolean Gröbner Bases ⋮ 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 ⋮ Generic regular decompositions for generic zero-dimensional systems
Uses Software
This page was built for publication: A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
