Decomposition of polynomial ideals into triangular regular sequences
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3859276 (Why is no real title available?)
- scientific article; zbMATH DE number 4164173 (Why is no real title available?)
- scientific article; zbMATH DE number 3970886 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 1263377 (Why is no real title available?)
- scientific article; zbMATH DE number 1302473 (Why is no real title available?)
- scientific article; zbMATH DE number 622670 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 1961165 (Why is no real title available?)
- scientific article; zbMATH DE number 1979251 (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 efficient algorithm for computing Gröbner bases (F₄)
- A new method for solving algebraic systems of positive dimension
- A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
- An elimination method for polynomial systems
- Complexity results for triangular sets
- Comprehensive Triangular Decomposition
- Computing strong regular characteristic pairs with Gröbner bases
- Decomposing polynomial systems into simple systems
- Decomposition of polynomial sets into characteristic pairs
- Elimination methods
- Gröbner bases and primary decomposition of polynomial ideals
- Ideal basis and primary decompositions: case of two variables
- Ideals, Varieties, and Algorithms
- Localization and primary decomposition of polynomial ideals
- Multiplicity-preserving triangular set decomposition of two polynomials
- On the connection between Ritt characteristic sets and Buchberger-Gröbner bases
- On the theories of triangular sets
- Solving zero-dimensional algebraic systems
- Squarefree normal representation of zeros of zero-dimensional polynomial systems
- Towards extending Fulton's algorithm for computing intersection multiplicities beyond the bivariate case
- Triangular sets for solving polynomial systems: a comparative implementation of four methods
- Unmixed-dimensional decomposition of a finitely generated perfect differential ideal
- Using Algebraic Geometry
- When does \((T)\) equal \(\mathrm{sat}(T)\)?
- Zero decomposition with multiplicity for zero-dimensional polynomial systems
This page was built for publication: Decomposition of polynomial ideals into triangular regular sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7033538)
