We present here an algorithm for an efficient computation of factorizations of linear differential operators with power series coefficients in an exponential extension of a base field. This algorithmâ€¦ (More)

We describe a new algorithm for computing the solutions in F = C(& ,s f(,ckiJ: ) of linear ordinary differential equations with coefficients in F. Colnpared to the gcncral algorithm of [9], ourâ€¦ (More)

We propose a polynomial time algorithm to decide whether the Galois group of an irreducible polynomial Æ’ âˆˆ Q[<italic>x</italic>] is abelian, and, if so, determine all its elements along with theirâ€¦ (More)

We describe a new algorithm for computing the solutions in F = C(x; e R f(x)dx) of linear ordinary diierential equations with coeecients in F. Compared to the general algorithm of 9], our algorithmâ€¦ (More)

Let k be a diierence eld with automorphism. Let b be an element of k, and L be a linear ordinary diierence operator with coeecients in k. A classical problem in the theory of diierence equations isâ€¦ (More)