Ore polynomial rings and linear systems reducing (Q2563466)

A system of linear ordinary differential equations with variable coefficients can be solved by reduction to one equation for each unknown function. The same approach can be applied to difference equations, and the so called \(q\)-difference equations. But in computer algebra systems these problems are solved by different algorithms. In this note the authors propose a unified algorithm for the three types of problems. This algorithm is based on Ore polynomials, and is implemented under MAPLE.