TY - JOUR
ID - 85482
TI - A variant of van Hoeij's algorithm to compute hypergeometric term solutions of holonomic recurrence equations
JO - Journal of Algorithms and Computation
JA - JAC
LA - en
SN - 2476-2776
Y1 - 2022
PY - 2022
VL -
IS -
SP - 1
EP - 32
DO - 10.22059/jac.2022.85482
N2 - Linear and homogeneous recurrence equations having polynomial coefficients are said to be holonomic. These equations are useful for proving and discovering combinatorial and hypergeometric identities. Given a field $\mathbb{K}$ of characteristic zero, $a_n$ is a hypergeometric term with respect to $\mathbb{K}$, if the ratio $a_{n+1}/a_n$ is a rational function over $\mathbb{K}$. Two algorithms by Marko Petkov\v{s}ek (1993) and Mark van Hoeij (1999) were proposed to compute hypergeometric term solutions of holonomic recurrence equations. The latter algorithm is more efficient and was implemented by its author in the Computer Algebra System (CAS) Maple through the command \texttt{LREtools[hypergeomsols]}.
We describe a variant of van Hoeij's algorithm that performs with the same efficiency without considering certain recommendations of the original version. We implemented our algorithm in the CASes Maxima and Maple. It also appears for some particular cases that our code finds results where \texttt{LREtools[hypergeomsols]} fails.
UR - https://jac.ut.ac.ir/article_85482.html
L1 - https://jac.ut.ac.ir/article_85482_75330a8526cb2d8f724c6f5bfa207566.pdf
ER -