Characteristic decomposition: from regular sets to normal sets
From MaRDI portal
Recommendations
- Characteristic decomposition of polynomial sets
- Decomposition of polynomial sets into characteristic pairs
- Decomposing polynomial sets simultaneously into Gröbner bases and normal triangular sets
- On the theories of triangular 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 4164173 (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 2151220 (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
- 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
- Computing triangular systems and regular systems
- Decomposing polynomial sets into simple sets over finite fields: the positive-dimensional case
- Decomposing polynomial sets simultaneously into Gröbner bases and normal triangular sets
- 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
- 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 connection between Ritt characteristic sets and Buchberger-Gröbner bases
- On the theories of triangular sets
- Solving zero-dimensional algebraic systems
Cited in
(10)- Computing strong regular characteristic pairs with Gröbner bases
- Characteristic decomposition of polynomial sets
- A new algorithmic scheme for computing characteristic sets
- Squarefree normal representation of zeros of zero-dimensional polynomial systems
- On characteristic decomposition and quasi-characteristic decomposition
- Decomposition of polynomial sets into characteristic pairs
- Decomposing polynomial sets simultaneously into Gröbner bases and normal triangular sets
- Some Properties of Triangular Sets and Improvement Upon Algorithm CharSer
- Foreword to the special issue
- scientific article; zbMATH DE number 1860738 (Why is no real title available?)
This page was built for publication: Characteristic decomposition: from regular sets to normal sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1730299)
