Decomposition of polynomial sets into characteristic pairs
From MaRDI portal
Publication:4960083
Abstract: A characteristic pair is a pair (G,C) of polynomial sets in which G is a reduced lexicographic Groebner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be decomposed algorithmically into finitely many characteristic pairs with associated zero relations, which provide representations for the zero set of P in terms of those of Groebner bases and those of triangular sets. The algorithm we propose for the decomposition makes use of the inherent connection between Ritt characteristic sets and lexicographic Groebner bases and is based essentially on the structural properties and the computation of lexicographic Groebner bases. Several nice properties about the decomposition and the resulting characteristic pairs, in particular relationships between the Groebner basis and the triangular set in each pair, are established. Examples are given to illustrate the algorithm and some of the properties.
Recommendations
- Characteristic decomposition of polynomial sets
- Computing strong regular characteristic pairs with Gröbner bases
- Decomposing polynomial sets simultaneously into Gröbner bases and normal triangular sets
- Characteristic decomposition: from regular sets to normal sets
- On characteristic decomposition and quasi-characteristic decomposition
Cites work
- scientific article; zbMATH DE number 1601215 (Why is no real title available?)
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 3970886 (Why is no real title available?)
- scientific article; zbMATH DE number 1263377 (Why is no real title available?)
- scientific article; zbMATH DE number 1979251 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- scientific article; zbMATH DE number 1860740 (Why is no real title available?)
- scientific article; zbMATH DE number 2110642 (Why is no real title available?)
- scientific article; zbMATH DE number 3056446 (Why is no real title available?)
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- A new algorithm for computing comprehensive Gröbner systems
- A new efficient algorithm for computing Gröbner bases (F₄)
- A new framework for computing Gröbner bases
- A new method for solving algebraic systems of positive dimension
- A note on upper bounds for ideal-theoretic problems
- A remark on a remark by Macaulay or enhancing Lazard structural theorem
- Algorithmic Thomas decomposition of algebraic and differential systems
- Algorithms for computing triangular decomposition of polynomial systems
- An Algorithm for Transforming Regular Chain into Normal Chain
- An algorithm for decomposing a polynomial system into normal ascending sets
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- An elimination method for polynomial systems
- Comprehensive Gröbner bases
- Comprehensive Triangular Decomposition
- Computing triangular systems and regular systems
- Converting bases with the Gröbner walk
- Decomposing polynomial sets into simple sets over finite fields: the positive-dimensional case
- Decomposing polynomial systems into simple systems
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Elimination methods
- Gröbner bases and primary decomposition of polynomial ideals
- Ideal basis and primary decompositions: case of two variables
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Localization and primary decomposition of polynomial ideals
- Mechanical theorem proving in geometries. Basic principles. Transl. from the Chinese by Xiaofan Jin and Dongming Wang
- On the complexity of computing with zero-dimensional triangular sets
- On the connection between Ritt characteristic sets and Buchberger-Gröbner bases
- On the dimension of an arbitrary ascending chain
- On the links between triangular sets and dynamic constructible closure
- On the theories of triangular sets
- Properties of Gröbner bases under specializations
- Regeneration homotopies for solving systems of polynomials
- Ritt-Wu's decomposition algorithm and geometry theorem proving
- Solving systems of algebraic equations by using Gröbner bases
- Triangular sets for solving polynomial systems: a comparative implementation of four methods
- Triangular systems and a generalization of primitive polynomials
- When does \(\langle T \rangle\) equal \(\text{sat}(T)\)?
Cited in
(13)- Computing strong regular characteristic pairs with Gröbner bases
- Ordering in solving systems of equations
- Characteristic decomposition of polynomial sets
- Characteristic decomposition: from regular sets to normal sets
- scientific article; zbMATH DE number 1057751 (Why is no real title available?)
- Squarefree normal representation of zeros of zero-dimensional polynomial systems
- Characteristic sets verses generalized characteristic sets
- Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
- On characteristic decomposition and quasi-characteristic decomposition
- Decomposing polynomial sets simultaneously into Gröbner bases and normal triangular sets
- scientific article; zbMATH DE number 4033589 (Why is no real title available?)
- Comprehensive characteristic decomposition of parametric polynomial systems
- Zero decomposition algorithms for systems of polynomial equations
This page was built for publication: Decomposition of polynomial sets into characteristic pairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4960083)
