On the complexity of solving ordinary differential equations in terms of Puiseux series

We prove that the binary complexity of solving ordinary polynomial differential equations in terms of Puiseux series is single exponential in the number of terms in the series. Such a bound was given by Grigoriev [10] for Riccatti differential polynomials associated to ordinary linear differential operators. In this paper, we get the same bound for arbitrary differential polynomials. The algorithm is based on a differential version of the Newton-Puiseux procedure for algebraic equations

Analogue of Newton-Puiseux series for non-holonomic D-modules and factoring

We introduce a concept of a fractional-derivatives series and prove that any linear partial differential equation in two independent variables has a fractional-derivatives series solution with coefficients from a differentially closed field of zero characteristic. The obtained results are extended from a single equation to $D$-modules having infinite-dimensional space of solutions (i. e. non-holonomic $D$-modules). As applications we design algorithms for treating first-order factors of a linear partial differential operator, in particular for finding all (right or left) first-order factors