Decomposition of polynomial sets into characteristic pairs
From MaRDI portal
Publication:4960083
DOI10.1090/MCOM/3504zbMATH Open1439.68031arXiv1702.08664OpenAlexW2991157132WikidataQ126768281 ScholiaQ126768281MaRDI QIDQ4960083FDOQ4960083
Chenqi Mou, Dongming Wang, Rina Dong
Publication date: 8 April 2020
Published in: Mathematics of Computation (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1702.08664
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
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Solving polynomial systems; resultants (13P15)
Cites Work
- Title not available (Why is that?)
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Title not available (Why is that?)
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Title not available (Why is that?)
- On the complexity of computing with zero-dimensional triangular sets
- Title not available (Why is that?)
- Gröbner bases and primary decomposition of polynomial ideals
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Title not available (Why is that?)
- Elimination methods
- Comprehensive Gröbner bases
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- Decomposing polynomial systems into simple systems
- On the theories of triangular sets
- A new algorithm for computing comprehensive Gröbner systems
- Regeneration homotopies for solving systems of polynomials
- Comprehensive Triangular Decomposition
- Title not available (Why is that?)
- A new framework for computing Gröbner bases
- Converting bases with the Gröbner walk
- Triangular systems and a generalization of primitive polynomials
- A new method for solving algebraic systems of positive dimension
- Computing triangular systems and regular systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Properties of Gröbner bases under specializations
- Mechanical theorem proving in geometries. Basic principles. Transl. from the Chinese by Xiaofan Jin and Dongming Wang
- When does \(\langle T \rangle\) equal \(\text{sat}(T)\)?
- An elimination method for polynomial systems
- Triangular sets for solving polynomial systems: a comparative implementation of four methods
- Title not available (Why is that?)
- Algorithms for computing triangular decomposition of polynomial systems
- Localization and primary decomposition of polynomial ideals
- Ideal basis and primary decompositions: case of two variables
- Algorithmic Thomas decomposition of algebraic and differential systems
- Decomposing polynomial sets into simple sets over finite fields: the positive-dimensional case
- An Algorithm for Transforming Regular Chain into Normal Chain
- Solving systems of algebraic equations by using gröbner bases
- On the dimension of an arbitrary ascending chain
- A note on upper bounds for ideal-theoretic problems
- A remark on a remark by Macaulay or enhancing Lazard structural theorem
- On the links between triangular sets and dynamic constructible closure
- On the connection between Ritt characteristic sets and Buchberger-Gröbner bases
- An algorithm for decomposing a polynomial system into normal ascending sets
- Ritt-Wu's decomposition algorithm and geometry theorem proving
Cited In (8)
- Computing strong regular characteristic pairs with Gröbner bases
- Ordering in solving systems of equations
- Title not available (Why is that?)
- Squarefree normal representation of zeros of zero-dimensional polynomial systems
- Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
- Title not available (Why is that?)
- Comprehensive characteristic decomposition of parametric polynomial systems
- Zero decomposition algorithms for systems of polynomial equations
Uses Software
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)
