A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
Journal of Symbolic Computation
Efficient computation of zero-dimensional Gro¨bner bases by change of ordering
Journal of Symbolic Computation
On the theories of triangular sets
Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Factorization-free decomposition algorithms in differential algebra
Journal of Symbolic Computation - Special issue on symbolic computation in algebra, analysis and geometry
Computing triangular systems and regular systems
Journal of Symbolic Computation
Unmixed-dimensional decomposition of a finitely generated perfect differential ideal
Journal of Symbolic Computation
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
An Algorithm for Transforming Regular Chain into Normal Chain
Computer Mathematics
Computing representations for radicals of finitely generated differential ideals
Applicable Algebra in Engineering, Communication and Computing - Special Issue: Jacobi's Legacy
Comprehensive triangular decomposition
CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
Hi-index | 0.00 |
This paper provides an algorithm which computes the normal form of a rational differential fraction modulo a regular differential chain if, and only if, this normal form exists. A regularity test for polynomials modulo regular chains is revisited in the nondifferential setting and lifted to differential algebra. A new characterization of regular chains is provided.