International audienceWe give an algorithm which represents the radical J of a finitely generated differential ideal as an intersection of radical differential ideals. The computed representation provides an algorithm for testing membership in J. This algorithm works over either an ordinary or a partial differential polynomial ring of characteristic zero. It has been programmed. We also give a method to obtain a obtain a characteristic set of J, if the ideal is prime
AbstractWe consider the Rosenfeld–Gröbner algorithm for computing a regular decomposition of a radic...
The author version (this one) is one page longer than the editor version. This difference is only du...
AbstractWe propose a method for computing the radical of an arbitrary ideal in the polynomial ring i...
International audienceWe give an algorithm which represents the radical J of a finitely generated di...
We give an algorithm which represents the radical J of a finitely generated differential ideal as an...
AbstractWe call a differential ideal universally characterizable, if it is characterizable w.r.t. an...
AbstractLet F be a finite subset of the differential polynomial algebra k { y 1,⋯ , yn } . In order ...
. We present an effective version of Ritt's algorithm. We apply material of (Boulier et al. 199...
AbstractWe propose an algorithm for computing the radical of a polynomial ideal in positive characte...
AbstractWe present an algorithm that computes an unmixed-dimensional decomposition of a finitely gen...
The regular representation of the radical of a differential ideal has various applications such as s...
rédigée en 1993-1994This thesis aims at making effective some theorems and at implemeting efficientl...
AbstractWe consider the Rosenfeld–Gröbner algorithm for computing a regular decomposition of a radic...
The author version (this one) is one page longer than the editor version. This difference is only du...
AbstractWe propose a method for computing the radical of an arbitrary ideal in the polynomial ring i...
International audienceWe give an algorithm which represents the radical J of a finitely generated di...
We give an algorithm which represents the radical J of a finitely generated differential ideal as an...
AbstractWe call a differential ideal universally characterizable, if it is characterizable w.r.t. an...
AbstractLet F be a finite subset of the differential polynomial algebra k { y 1,⋯ , yn } . In order ...
. We present an effective version of Ritt's algorithm. We apply material of (Boulier et al. 199...
AbstractWe propose an algorithm for computing the radical of a polynomial ideal in positive characte...
AbstractWe present an algorithm that computes an unmixed-dimensional decomposition of a finitely gen...
The regular representation of the radical of a differential ideal has various applications such as s...
rédigée en 1993-1994This thesis aims at making effective some theorems and at implemeting efficientl...
AbstractWe consider the Rosenfeld–Gröbner algorithm for computing a regular decomposition of a radic...
The author version (this one) is one page longer than the editor version. This difference is only du...
AbstractWe propose a method for computing the radical of an arbitrary ideal in the polynomial ring i...