Comprehensive Gröbner bases

DOI10.1016/0747-7171(92)90023-WzbMath0784.13013MaRDI QIDQ1199704

Volker Weispfenning

Publication date: 16 January 1993

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

polynomial idealcomprehensive Gröbner basisfast elimination of quantifier blocks

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Related Items (83)

An alternative approach to comprehensive Gröbner bases ⋮ Canonical comprehensive Gröbner bases ⋮ Gröbner systems conversion ⋮ Automatic classification of normal forms ⋮ Testing binomiality of chemical reaction networks using comprehensive Gröbner systems ⋮ First order perturbation and local stability of parametrized systems ⋮ Exploring the potential energy landscape over a large parameter-space ⋮ Comprehensive Gröbner systems in PBW algebras, Bernstein-Sato ideals and holonomic \(D\)-modules ⋮ On computing uniform Gröbner bases for ideals generated by polynomials with parametric exponents ⋮ Computing comprehensive Gröbner systems: a comparison of two methods ⋮ Linear spaces, transversal polymatroids and ASL domains ⋮ Stability analysis for discrete biological models using algebraic methods ⋮ Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm ⋮ Analyzing Boolean functions via solving parametric polynomial systems ⋮ Gröbner bases for polynomial systems with parameters ⋮ A quantifier-elimination based heuristic for automatically generating inductive assertions for programs ⋮ 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 ⋮ Machine learning the real discriminant locus ⋮ Gröbner bases plugged into graphical skills to solve a set of multiple bifurcation equations in structural compound stability problems ⋮ Solving the perspective-three-point problem using comprehensive Gröbner systems ⋮ On the computation of parametric Gröbner bases for modules and syzygies ⋮ An efficient method of finding new symplectic schemes for Hamiltonian mechanics problems with the aid of parametric Gröbner bases ⋮ Generic Gröbner basis of a parametric ideal and its application to a comprehensive Gröbner system ⋮ Cohomology, stratifications and parametric Gröbner bases in characteristic zero. ⋮ Artificial discontinuities of single-parametric Gröbner bases ⋮ On the computation of the Galois group of linear difference equations ⋮ Restrictions of Pfaffian systems for Feynman integrals ⋮ Generic regular decompositions for parametric polynomial systems ⋮ Boolean Gröbner bases ⋮ Automated reducible geometric theorem proving and discovery by Gröbner basis method ⋮ On solving parametric polynomial systems ⋮ On the parametric behavior of $A$-hypergeometric series ⋮ Parametric equation solving and quantifier elimination in finite fields with the characteristic set method ⋮ An algorithm for solving partial differential parametric systems. ⋮ CGSQE/SyNRAC ⋮ Universal and comprehensive Gröbner bases of the classical determinantal ideal ⋮ Characteristic decomposition: from regular sets to normal sets ⋮ A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases ⋮ Solving parametric polynomial systems ⋮ Comprehensive Gröbner bases and regular rings ⋮ Improving the DISPGB algorithm using the discriminant ideal ⋮ A parametric approach to 3D dynamic geometry ⋮ Generalizing the Steiner-Lehmus theorem using the Gröbner cover ⋮ On systems of algebraic equations with parametric exponents. II ⋮ Gröbner bases for families of affine or projective schemes ⋮ Minimal polynomial systems for parametric matrices ⋮ Parametric FGLM algorithm ⋮ Algebraic local cohomology with parameters and parametric standard bases for zero-dimensional ideals ⋮ Irreducibility criterion for algebroid curves ⋮ Computer algebra methods in the study of nonlinear differential systems ⋮ Complexity of solving parametric polynomial systems ⋮ When is a polynomial ideal binomial after an ambient automorphism? ⋮ A parametric representation of totally mixed Nash equilibria ⋮ On the Computation of Elimination Ideals of Boolean Polynomial Rings ⋮ Degree reduction under specialization ⋮ Gröbner bases over fields with valuations ⋮ Equations of Riemann surfaces with automorphisms ⋮ Constructibility of the set of polynomials with a fixed Bernstein-Sato polynomial: an algorithmic approach. ⋮ On computing absolutely irreducible components of algebraic varieties with parameters ⋮ Comprehensive Gröbner Bases in a Java Computer Algebra System ⋮ Cylinders Through Five Points: Complex and Real Enumerative Geometry ⋮ Automatic Discovery of Geometry Theorems Using Minimal Canonical Comprehensive Gröbner Systems ⋮ Finding new families of rank-one convex polynomials ⋮ A Variant of the F4 Algorithm ⋮ Decomposition of polynomial sets into characteristic pairs ⋮ Reduction Mod p of Standard Bases ⋮ Minimal canonical comprehensive Gröbner systems ⋮ Symbolic computations of the equilibrium orientations of a system of two connected bodies moving on a circular orbit around the Earth ⋮ On QE algorithms over an algebraically closed field based on comprehensive Gröbner systems ⋮ $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation ⋮ On the Computation of Comprehensive Boolean Gröbner Bases ⋮ A Study on Gröbner Basis with Inexact Input ⋮ A Numerical Method for Computing Border Curves of Bi-parametric Real Polynomial Systems and Applications ⋮ Dynamic balancing of planar mechanisms using toric geometry ⋮ Applying Gröbner basis method to multiparametric polynomial nonlinear programming ⋮ Computer algebra and algebraic geometry -- achievements and perspectives ⋮ Generic regular decompositions for generic zero-dimensional systems ⋮ Comprehensive LU Factors of Polynomial Matrices ⋮ On Gröbner bases under specialization ⋮ A new algorithm for discussing Gröbner bases with parameters. ⋮ On a Lyapunov equation for polynomial continuous-time systems

Cites Work

• Non-commutative Gröbner bases in algebras of solvable type
• Some examples for solving systems of algebraic equations by calculating Gröbner bases
• New constructive methods in classical ideal theory
• Real quantifier elimination is doubly exponential
• An extension of Buchberger's algorithm and calculations in enveloping fields of Lie algebras
• Stability of Gröbner bases
• Computing dimension and independent sets for polynomial ideals
• The Gröbner fan of an ideal
• Nullstellensatz effectif et Conjecture de Serre (Théorème de Quillen-Suslin) pour le Calcul Formel
• Admissible orders and linear forms
• Solving systems of algebraic equations by using gröbner bases
• Properties of Gröbner bases under specializations
• An extension of buchberger's algorithm to compute all reduced gröbner bases of a polynomial ideal
• Gröbner bases for polynomial ideals over commutative regular rings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Comprehensive Gröbner bases