Converging to Gosper's algorithm (Q950412)

Let \(K\) be a field of characteristic zero. A nonzero term \(t_n\) is called a hypergeometric term over \(K\) if there exists a rational function, \(r\in K(n)\) such that \(t_{n+1}/t_n= r(n)\). In [Proc. Natl. Acad. Sci. USA 75, 40--42 (1978; Zbl 0384.40001)] \textit{R. W. Gosper, jun.} introduced an algorithm as a procedure to find a hypergeometric term \(z_n\) satisfying \(z_{n+1}- z_n= t_n\), if it exists, or confirm the nonexistence of any solution. More generally, given a linear difference equation, \textit{S. A. Abramov} has offered in [Difference equations in the field of rational functions. Analytical and numerical methods for solving problems of mathematical physics, Work Collect., Moskva, 117--121 (1989; Zbl 0728.39002)] another algorithm. The author presents a unified approach to computing the so-called universal denominators as given by Gosper's algorithm and Abramov's algorithm for finding rational solutions to linear difference equations with polynomial coefficients.