Abstract
Bavula proved in \cite{Bavula2013} that the ring I_1(k) of polynomial ordinary integro-differential operators over a field k of characteristic zero is coherent in the sense that every left/right kernel of every finite rectangular matrix with entries in I_1(k) is a finitely generated left/right I_1(k)-modules. Unfortunately, his proof is not algorithmic. This paper gives an algorithmic proof of the coherence of I_1(k). We show that the kernel computation can be reduced to a kernel computation in the ring of skew Laurent polynomials B_1(k) = k[H] < sigma, sigma^{-1} | sigma H = (H + 1) sigma, sigma^{-1} H = (H -1) sigma^{-1} > = I_1(k) / < e > -- where < e > is the only two-sided ideal of I_1(k) defined by the evaluation operators -- and the computation of polynomial solutions of linear polynomial integro-differential systems. These two problems are shown to be effective. We also prove that I_1(k) is an effective Cramer ring (i.e., a computable ring \cite{Barakat,Posur} or a coherent strongly discrete ring \cite{Mines-Richman-Ruitenburg}) in the sense that the solutions of every linear system of the form A X = Y or X A = Y, where A and Y are two fixed rectangular matrices with entries in I_1(k), can be parametrized effectively. The algorithmic proof of the coherence (respectively, the Cramer property) of I_1(k) allows us to develop an algorithmic elimination theory (respectively, an effective homological algebra) for linear systems of polynomial integro-differential equations with separable polynomial kernels. Finally, the algorithms given here are implemented in a Maple package called Bavula.

This publication has 23 references indexed in Scilit: