On the Gosper-Petkovšek representation of rational functions

Authors:
William Y. C. Chen;Husam L. Saad
Affiliations:
Center for Combinatorics, LPMC, Nankai University, Tianjin 300071, PR China;Center for Combinatorics, LPMC, Nankai University, Tianjin 300071, PR China
Venue:
Journal of Symbolic Computation
Year:
2005

Citing 7
Cited 0

Concrete mathematics: a foundation for computer science

Concrete mathematics: a foundation for computer science
Hypergeometric solutions of linear recurrences with polynomial coefficients

Journal of Symbolic Computation - Special issue on symbolic computation in combinatorics
A generalization of Gosper's algorithm

Proceedings of the 2nd Slovenian conference on Algebraic and topological methods in graph theory
On Zeilberger's algorithm and its q-analogue

VII SPOA Proceedings of the seventh Spanish symposium on Orthogonal polynomials and applications
Greatest factorial factorization and symbolic summation

Journal of Symbolic Computation
q-hypergeometric solutions of q-difference equations

Proceedings of the 7th conference on Formal power series and algebraic combinatorics
Algorithm for q-hypergeometric summation in computer algebra

Journal of Symbolic Computation - Special issue on orthogonal polynomials and computer algebra

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the uniqueness of the Gosper-Petkovsek representation of rational functions can be utilized to give a simpler version of Gosper's algorithm. This approach also applies to Petkovsek's generalization of Gosper's algorithm, and its q-analogues by Abramov-Paule-Petkovsek and Boing-Koepf.