Minimal canonical comprehensive Gröbner systems
From MaRDI portal
(Redirected from Publication:1012136)
Abstract: This is the continuation of Montes' paper "On the canonical discussion of polynomial systems with parameters". In this paper we define the Minimal Canonical Comprehensive Groebner System (MCCGS) of a parametric ideal and fix under which hypothesis it exists and is computable. An algorithm to obtain a canonical description of the segments of the MCCGS is given, completing so the whole MCCGS algorithm (implemented in Maple). We show its high utility for applications, like automatic theorem proving and discovering, and compare it with other existing methods. A way to detect a counterexample is outlined, although the high number of tests done give evidence of the existence of the MCCGS.
Recommendations
Cites work
- A new algorithm for discussing Gröbner bases with parameters.
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
- An alternative approach to comprehensive Gröbner bases
- Automatic Discovery of Geometry Theorems Using Minimal Canonical Comprehensive Gröbner Systems
- Canonical comprehensive Gröbner bases
- Comprehensive Gröbner bases
- Computer Algebra in Scientific Computing
- Gröbner bases for families of affine or projective schemes
- Improving the DISPGB algorithm using the discriminant ideal
- On the stability of Gröbner bases under specializations
Cited in
(23)- Automatic Discovery of Geometry Theorems Using Minimal Canonical Comprehensive Gröbner Systems
- A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases
- Canonical comprehensive Gröbner bases
- A parametric \(\mathrm{F}_4\) algorithm
- Gröbner systems conversion
- Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm
- Computing the canonical representation of constructible sets
- First order perturbation and local stability of parametrized systems
- On solving parametric polynomial systems
- Cylinders Through Five Points: Complex and Real Enumerative Geometry
- Computing comprehensive Gröbner systems: a comparison of two methods
- Improvement of an incremental signature-based comprehensive Gröbner system algorithm
- On computing absolutely irreducible components of algebraic varieties with parameters
- Generalizing the Steiner-Lehmus theorem using the Gröbner cover
- An algorithm for minimal generating set of parametric homogeneous polynomial ideals
- Gröbner bases for polynomial systems with parameters
- Minimal resultant systems
- Minimal polynomial systems for parametric matrices
- Algorithmic detection of conserved quantities for finite-difference schemes
- Parametric FGLM algorithm
- Comprehensive characteristic decomposition of parametric polynomial systems
- Automated reducible geometric theorem proving and discovery by Gröbner basis method
- An efficient method of finding new symplectic schemes for Hamiltonian mechanics problems with the aid of parametric Gröbner bases
This page was built for publication: Minimal canonical comprehensive Gröbner systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1012136)
