A new algorithm for discussing Gröbner bases with parameters.

DOI10.1006/JSCO.2001.0504zbMath1068.13016OpenAlexW2095764258MaRDI QIDQ1599542

Antonio Montes

Publication date: 11 June 2002

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

Full work available at URL: https://semanticscholar.org/paper/56870e052ccd45ac00f45b6a8d24dcdf94b6824c

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (46)

An improvement of the rational representation for high-dimensional systems ⋮ An alternative approach to comprehensive Gröbner bases ⋮ Canonical comprehensive Gröbner bases ⋮ Gröbner systems conversion ⋮ 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 ⋮ Finding all Nash equilibria of a finite game using polynomial algebra ⋮ 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 ⋮ 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 ⋮ Algorithms for computing greatest common divisors of parametric multivariate polynomials ⋮ Boolean Gröbner bases ⋮ Automated reducible geometric theorem proving and discovery by Gröbner basis method ⋮ On solving parametric polynomial systems ⋮ On factoring parametric multivariate polynomials ⋮ A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases ⋮ Improving the DISPGB algorithm using the discriminant ideal ⋮ Computing strong regular characteristic pairs with Gröbner bases ⋮ 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 ⋮ Computer algebra methods in the study of nonlinear differential systems ⋮ Complexity of solving parametric polynomial systems ⋮ On the Computation of Elimination Ideals of Boolean Polynomial Rings ⋮ A new algorithm for computing regular representations for radicals of parametric differential ideals ⋮ Erratum to ``A new algorithm for discussing Gröbner bases with parameters [J. Symbolic Comput. 33 (1-2) (2002) 183-208] ⋮ On computing absolutely irreducible components of algebraic varieties with parameters ⋮ Comprehensive Gröbner Bases in a Java Computer Algebra System ⋮ Automatic Discovery of Geometry Theorems Using Minimal Canonical Comprehensive Gröbner Systems ⋮ Minimal canonical comprehensive Gröbner systems ⋮ 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 ⋮ Dynamic balancing of planar mechanisms using toric geometry ⋮ Applying Gröbner basis method to multiparametric polynomial nonlinear programming ⋮ CSSg method for several genericities of parametric systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the construction of Gröbner bases using syzygies
• A theorem on refining division orders by the reverse lexicographic order
• On an installation of Buchberger's algorithm
• An algorithm for solving parametric linear systems
• Some results on Gröbner bases over commutative rings
• Comprehensive Gröbner bases
• On lucky ideals for Gröbner basis computations
• On lucky primes
• On Gröbner bases under specialization
• On the stability of Gröbner bases under specializations
• Algebraic solution of the load-flow problem for a 4-nodes electrical network
• On flatness of generic projections
• Dynamic evaluation and algebraic closure in Axiom
• Solving the load flow problem using Gröbner basis
• Solving systems of algebraic equations by using gröbner bases
• Properties of Gröbner bases under specializations

This page was built for publication: A new algorithm for discussing Gröbner bases with parameters.