An Algorithm for Transforming Regular Chain into Normal Chain
From MaRDI portal
Publication:3597999
DOI10.1007/978-3-540-87827-8_20zbMath1166.13300OpenAlexW2123254909MaRDI QIDQ3597999
Publication date: 29 January 2009
Published in: Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87827-8_20
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Polynomials, factorization in commutative rings (13P05)
Related Items (5)
Computing equilibria of semi-algebraic economies using triangular decomposition and real solution classification ⋮ Characteristic decomposition: from regular sets to normal sets ⋮ Computing strong regular characteristic pairs with Gröbner bases ⋮ Decomposition of polynomial sets into characteristic pairs ⋮ Hrushovski's algorithm for computing the Galois group of a linear differential equation
Cites Work
- Unnamed Item
- Unnamed Item
- Elimination methods
- A new method for solving algebraic systems of positive dimension
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- On the theories of triangular sets
- An algorithm for decomposing a polynomial system into normal ascending sets
- Unmixed-dimensional decomposition of a finitely generated perfect differential ideal
This page was built for publication: An Algorithm for Transforming Regular Chain into Normal Chain