Comprehensive Gröbner bases
From MaRDI portal
The method of Gröbner bases is one of the fundamental algorithmic tools in polynomial algebra and algebraic geometry. The construction of a Gröbner basis of the ideal generated by a finite set of polynomials is very unstable under variation of the coefficients of the input polynomials. With the aim of solving parametric problems, the author introduces the notion of a ``comprehensive Gröbner basis: Let \(K\) be an integral domain and \(S\) be the polynomial ring \(K[U_ 1,\ldots,U_ m;X_ 1,\ldots,X_ n]\). Given a finite set \(F\subseteq S\) and a term order \(\leq\) in the main variables \(X_ 1,\ldots,X_ n\), a comprehensive Gröbner basis \(G\) of the ideal \(Id(F)\) is a finite ideal basis of \(Id(F)\) that is a Gröbner basis of \(Id(F)\) in \(K'[X_ 1,\ldots,X_ n]\) (with respect to the term order \(\leq)\), for every specialization of the parameters \(U_ 1,\ldots,U_ m\) in an arbitrary field \(K'\). The main result of the paper is an explicit algorithmic construction over a computable ring \(K\) of a comprehensive Gröbner basis \(G\) from any finite set \(F\) and any decidable term order \(\leq\). The author shows that this construction can be performed with the same worst case degree bounds in the main variables as for ordinary Gröbner bases and presents some examples computed in an ALDES/SAC-2 implementation. Applications of comprehensive Gröbner bases are given to several parametric problems in polynomial algebra and algebraic geometry; in particular, to ``fast elimination of quantifier blocks in algebraically closed fields.
Recommendations
- Canonical comprehensive Gröbner bases
- scientific article; zbMATH DE number 2151245
- An efficient method for computing comprehensive Gröbner bases
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
- Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm
Cites work
- Admissible orders and linear forms
- An extension of Buchberger's algorithm and calculations in enveloping fields of Lie algebras
- An extension of Buchberger's algorithm to compute all reduced Gröbner bases of a polynomial ideal
- Computing dimension and independent sets for polynomial ideals
- Gröbner bases for polynomial ideals over commutative regular rings
- scientific article; zbMATH DE number 4132308 (Why is no real title available?)
- scientific article; zbMATH DE number 4132309 (Why is no real title available?)
- scientific article; zbMATH DE number 4137919 (Why is no real title available?)
- scientific article; zbMATH DE number 3900153 (Why is no real title available?)
- scientific article; zbMATH DE number 3935185 (Why is no real title available?)
- scientific article; zbMATH DE number 3937298 (Why is no real title available?)
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 4065139 (Why is no real title available?)
- scientific article; zbMATH DE number 4069044 (Why is no real title available?)
- scientific article; zbMATH DE number 4072372 (Why is no real title available?)
- scientific article; zbMATH DE number 4077463 (Why is no real title available?)
- scientific article; zbMATH DE number 4084863 (Why is no real title available?)
- scientific article; zbMATH DE number 3771547 (Why is no real title available?)
- scientific article; zbMATH DE number 3036380 (Why is no real title available?)
- New constructive methods in classical ideal theory
- Non-commutative Gröbner bases in algebras of solvable type
- Nullstellensatz effectif et Conjecture de Serre (Théorème de Quillen-Suslin) pour le Calcul Formel
- Properties of Gröbner bases under specializations
- Real quantifier elimination is doubly exponential
- Solving systems of algebraic equations by using Gröbner bases
- Some examples for solving systems of algebraic equations by calculating Gröbner bases
- Stability of Gröbner bases
- The Gröbner fan of an ideal
Cited in
(only showing first 100 items - show all)- Minimal canonical comprehensive Gröbner systems
- Dynamic balancing of planar mechanisms using toric geometry
- On Gröbner bases under specialization
- Cohomology, stratifications and parametric Gröbner bases in characteristic zero.
- An algorithm for solving partial differential parametric systems.
- Computer algebra and algebraic geometry -- achievements and perspectives
- A new algorithm for discussing Gröbner bases with parameters.
- Comprehensive Gröbner systems in PBW algebras, Bernstein-Sato ideals and holonomic \(D\)-modules
- Computing comprehensive Gröbner systems: a comparison of two methods
- Universal Gröbner basis for parametric polynomial ideals
- 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
- An alternative approach to comprehensive Gröbner bases
- Canonical comprehensive Gröbner bases
- An efficient method for computing comprehensive Gröbner bases
- On solving parametric polynomial systems
- When is a polynomial ideal binomial after an ambient automorphism?
- Symbolic computations of the equilibrium orientations of a system of two connected bodies moving on a circular orbit around the Earth
- Parametric standard bases and their applications
- A parametric approach to 3D dynamic geometry
- Generalizing the Steiner-Lehmus theorem using the Gröbner cover
- Complexity of solving parametric polynomial systems
- Solving parametric ideal membership problems and computing integral numbers in a ring of convergent power series via comprehensive Gröbner systems
- 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
- Parametric equation solving and quantifier elimination in finite fields with the characteristic set method
- Universal and comprehensive Gröbner bases of the classical determinantal ideal
- Solving parametric polynomial systems
- Comprehensive Gröbner bases and regular rings
- Improving the DISPGB algorithm using the discriminant ideal
- Gröbner bases for families of affine or projective schemes
- Analyzing Boolean functions via solving parametric polynomial systems
- An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form
- Machine learning the real discriminant locus
- scientific article; zbMATH DE number 1574480 (Why is no real title available?)
- Comprehensive Gröbner bases in a Java computer algebra system
- \textsf{SC}\(^2\): satisfiability checking meets symbolic computation. (Project paper)
- An algorithm to check whether a basis of a parametric polynomial system is a comprehensive Gröbner basis and the associated completion algorithm
- A numerical method for computing border curves of bi-parametric real polynomial systems and applications
- Comprehensive involutive systems
- Stability conditions of monomial bases and comprehensive Gröbner systems
- First order perturbation and local stability of parametrized systems
- A new algorithm for computing comprehensive Gröbner systems
- Exploring the potential energy landscape over a large parameter-space
- A Variant of the F4 Algorithm
- On computing uniform Gröbner bases for ideals generated by polynomials with parametric exponents
- On the Computation of Elimination Ideals of Boolean Polynomial Rings
- Stability analysis for discrete biological models using algebraic methods
- On the Computation of Comprehensive Boolean Gröbner Bases
- A Study on Gröbner Basis with Inexact Input
- Automatic deduction in (dynamic) geometry: Loci computation
- Automatic classification of normal forms
- scientific article; zbMATH DE number 2034394 (Why is no real title available?)
- On the computation of the Galois group of linear difference equations
- On the parametric behavior of A-hypergeometric series
- scientific article; zbMATH DE number 2151243 (Why is no real title available?)
- scientific article; zbMATH DE number 2151245 (Why is no real title available?)
- Gröbner bases over fields with valuations
- Equations of Riemann surfaces with automorphisms
- Minimal polynomial systems for parametric matrices
- Irreducibility criterion for algebroid curves
- scientific article; zbMATH DE number 1424555 (Why is no real title available?)
- Decomposition of polynomial sets into characteristic pairs
- On Parametric Border Bases
- Comprehensive LU Factors of Polynomial Matrices
- On continuity of the roots of a parametric zero dimensional multivariate polynomial ideal
- Parametric FGLM algorithm
- Algebraic local cohomology with parameters and parametric standard bases for zero-dimensional ideals
- Comprehensive Gröbner bases in a Java computer algebra system
- Computing comprehensive Gröbner systems and comprehensive Gröbner bases simultaneously
- On a Lyapunov equation for polynomial continuous-time systems
- CGSQE/SyNRAC: a real quantifier elimination package based on the computation of comprehensive Gröbner systems
- A speed-up of the algorithm for computing comprehensive Gröbner systems
- Computer algebra methods in the study of nonlinear differential systems
- Cylinders Through Five Points: Complex and Real Enumerative Geometry
- Automatic Discovery of Geometry Theorems Using Minimal Canonical Comprehensive Gröbner Systems
- Reduction Mod p of Standard Bases
- scientific article; zbMATH DE number 2195269 (Why is no real title available?)
- Computer Algebra in Scientific Computing
- Degree reduction under specialization
- 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
- Gröbner bases for polynomial systems with parameters
- Gröbner bases plugged into graphical skills to solve a set of multiple bifurcation equations in structural compound stability problems
- 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
- Restrictions of Pfaffian systems for Feynman integrals
- On the computation of parametric Gröbner bases for modules and syzygies
- Artificial discontinuities of single-parametric Gröbner bases
- Boolean Gröbner bases
- Conditional Gröbner basis: Gröbner basis detection with parameters
- A parametric \(\mathrm{F}_4\) algorithm
- Algebraic study of receptor-ligand systems: a dose-response analysis
- Improvement of an incremental signature-based comprehensive Gröbner system algorithm
- Rationality and parametrizations of algebraic curves under specializations
This page was built for publication: Comprehensive Gröbner bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199704)
