On the computation of simple forms and regular solutions of linear difference systems (Q1716145): Difference between revisions

This paper is devoted to first-order linear difference systems with factorial series coefficients, i.e., \[ \Delta \mathbf{y}(z)=B(z)\,\mathbf{y}(z), \tag{1}\] where \(\mathbf{y}(z)\) is the vector of unknowns and \(B(z)\) is an \(n\times n\) matrix with generalized factorial series entries \[ B(z)=z^q \Big(B_0+\sum_{k=1}^\infty \frac{B_k}{z\,(z+1)\cdots(z+k+1)}\Big) \] with \(q\in\mathbb{Z}\) and \(B_k\in\mathbb{C}^{n\times n}\) such that \(B_0\neq0\). Since system (1) is gauge equivalent to the system \[\Delta \mathbf{y}(z)+A(z)\,\mathbf{y}(z)=0,\tag{2}\] where \(A(z)=\sum_{k\geq0} A_k\,z^{-[k]}\) with \(A_k\in\mathbb{C}^{n\times n}\) and \(z^{-[k]}=\Gamma(z)/\Gamma(z+k)\), the authors develop a new algorithm for the transformation of system (2) into a system with constant coefficients and determine its formal fundamental solution. This algorithm has been implemented in Maple by using the FactorialSeriesTools package and several illustrative examples are provided in the final section. For the entire collection see [Zbl 1391.33001].