On the q-Analogue of Zeilberger's Algorithm to Rational Functions

Authors:
H. Q. Le
Affiliations:
Symbolic Computation Group, University of Waterloo, Waterloo, Canada hqle@scg.math.uwaterloo.ca
Venue:
Programming and Computing Software
Year:
2001

Citing 6
Cited 2

The method of creative telescoping

Journal of Symbolic Computation
On Zeilberger's algorithm and its q-analogue

VII SPOA Proceedings of the seventh Spanish symposium on Orthogonal polynomials and applications
Indefinite sums of rational functions

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Algorithm for q-hypergeometric summation in computer algebra

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

Concrete Math
Applicability of Zeilberger's algorithm to hypergeometric terms

Proceedings of the 2002 international symposium on Symbolic and algebraic computation

A criterion for the applicability of Zeilberger's algorithm to rational functions

Discrete Mathematics
A direct algorithm to construct the minimal Z-pairs for rational functions

Advances in Applied Mathematics - Special issue on: Formal power series and algebraic combinatorics in memory of Rodica Simion, 1955-2000

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the applicability (or terminating conditions) of the q-analogue of Zeilberger's algorithm and give the complete solution to this problem for the case when the original q-hypergeometric term is a rational function.