Polynomial and rational solutions of holonomic systems (Q5951565)

Two algorithms based on the theory of \(D\)-modules to find polynomial and rational solutions of a given holonomic system [for a different approach see \textit{F. Chyzak}, Discrete Math. 217, 115-134 (2000; Zbl 0968.33011)] associated to a set of linear differential operators in the Weyl algebra \(D=\mathbf{k}\langle x_1,\dots,x_n,\partial_1\dots, \partial_n\rangle\), where \(\mathbf{k}\) is a given subfield of \(C\). The first algorithm obtains degree bounds on the solutions. The main techniques are Gröbner deformations in \(D\) [see \textit{M. Saito, B. Sturmfels} and \textit{N. Takayama}, Gröbner deformations of hypergeometric differential equations (Algorithms and Computation in Mathematics 6, Springer, Berlin) (1999; Zbl 0946.13021)] and the \(b\)-functions. The second algorithm evaluates the dimension of the polynomial and rational solutions using duality and restrictions [see \textit{U. Walther}, J. Symb. Comput. 29, 795-839 (2000; Zbl 0979.14011)].