Unmixed-dimensional decomposition of a finitely generated perfect differential ideal

From MaRDI portal
Publication:5937882

DOI10.1006/jsco.1999.1562zbMath1038.12005OpenAlexW1976944931MaRDI QIDQ5937882

Abdelilah Kandri Rody, Driss Bouziane, Hamid Maârouf

Publication date: 11 September 2001

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1999.1562



Related Items

A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity, Characteristic set algorithms for equation solving in finite fields, Algorithmic Thomas decomposition of algebraic and differential systems, On the efficiency of solving Boolean polynomial systems with the characteristic set method, Binomial difference ideals, Sparse difference resultant, A bound for the Rosenfeld-Gröbner algorithm, A criterion for testing whether a difference ideal is prime, Ritt-Wu characteristic set method for Laurent partial differential polynomial systems, Elimination theory in differential and difference algebra, An equivalence theorem for regular differential chains, An algorithm for decomposing a polynomial system into normal ascending sets, Properties of regular systems and algorithmic improvements for regular decomposition, Thomas Decomposition of Algebraic and Differential Systems, Differential algebra for derivations with nontrivial commutation rules, A bound for orders in differential Nullstellensatz, An Algorithm for Transforming Regular Chain into Normal Chain, Probabilistic algorithms for computing resolvent representations of regular differential ideals, A characteristic set method for ordinary difference polynomial systems, Computing representations for radicals of finitely generated differential ideals, Characteristic set method for differential-difference polynomial systems, Computing differential characteristic sets by change of ordering


Uses Software


Cites Work