We present an algorithm that computes an unmixed-dimensional decomposition of a finitely generated perfect differential ideal I. Each Ii in the decomposition I = I1 ∩ · · · ∩ Ik is given by its… (More)

Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our… (More)

We present an algorithm that tests the triviality and computes the differential dimension and a parametric set for an ordinary differential polynomial ideal. No factorization is needed. The basic… (More)

In this paper, polynomial ideal theory is used to deal with the problem of the Spacking coloring of a finite undirected and unweighted graph by introducing a family of polynomials encoding the… (More)

The singularity problem of the solutions of some particular Sylvester equations is studied. As a consequence of this study, a good choice of a Sylvester equation which is associated to a linear… (More)