Learn More
We 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.(More)
titot, " Computing representations for radicals of finitely generated differential ideals " , Special issue " Jacobi's Legacy Résumé Abstract Ce papier s'intéresse aux systèmes d'´ equations différentielles polynomiales, ordinaires ou aux dérivées partielles. La théorie sous-jacente est l'algèbre différentielle de Ritt et Kolchin. Nous décrivons un(More)
We present a new algorithm for solving basic parametric constructible or semi-algebraic If Π U denotes the canonical pro jection onto the parameter's space, solving C or S is reduced to the computation of submanifolds U ⊂ C d (resp. U ⊂ R d) such that (Π U −1 (U) ∩ C, Π U) is an analytic covering of U (we say that U has the (Π U , C)-covering property).(More)
Optimal solutions are given for the two following problems: the condition for a degree 4 polytmmial to have only positive valves and the condition for an ellipse to be inside the unit circle. The aim of this paper is to give optimal solutions for two classical quantifier elimination problems. These solutions are not obtained by existing general algorithms.(More)