Factorization-free decomposition algorithms in differential algebra (Q1569835)

The author investigates a representation of the radical differential ideal generated by a system of differential equations (ordinary or partial). Let \(({\mathcal R},\Theta)\) be a differential field of characteristic 0 where \(\Theta\) is the free monoid generated by the finite set \(\Delta\) of derivations of \(\mathcal R\), and let \(Y=\{y_1,\cdots,y_n\}\) be a finite set of indeterminates over \(\mathcal R\) and \({\mathcal R}\{Y\}\) denote the polynomial ring in infinitely many indeterminates \(\theta y\) with \(\theta \in \Theta\) and \(y \in Y\). For a subset \(\Sigma\) of \({\mathcal R}\{Y\}\), the differential ideal generated by \(\Sigma\) is denoted by \([\Sigma]\) and its differential radical is denoted by \(\{\Sigma\}\). The author gives essentially an algorithm to write \(\{\Sigma\}\) as an intersection of differential ideals that are uniquely defined by their characteristic sets. In the last section the algorithm is illustrated with some interesting examples calculated in Maple.