On Zeilberger's algorithm and its q-analogue
نویسندگان
چکیده
منابع مشابه
On Zeilberger’s algorithm and its q-analogue: a rigorous description
Gosper’s and Zeilberger’s algorithms for summation of terminating hypergeometric series as well as the q-versions of these algorithms are described in a very rigorous way. The paper is a companion to Maple V procedures implementing these algorithms. It concludes with the help information for these procedures.
متن کاملThe q-analogue of the alternating groups and its representations
Frobenius began the study of representation theory and character theory of the symmetric groups Sn at the turn of the century [4]. In this study, He showed that there is one irreducible representation πλ of Sn corresponding to each partition λ of n and this correspondence gives all of irreducible representations of Sn up to equivalency. After this work, he also began the study of representation...
متن کاملApplicability of the q-analogue of Zeilberger's algorithm
The applicability or terminating condition for the ordinary case of Zeilberger’s algorithm was recently obtained by Abramov. For the qanalogue, the question of whether a bivariate q-hypergeometric term has a qZ-pair remains open. Le has found a solution to this problem when the given bivariate q-hypergeometric term is a rational function in certain powers of q. We solve the problem for the gene...
متن کاملA Mathematica q - Analogue
Mathematica implementations, available by email request, of q-analogues of Gosper's and Zeilberger's algorithm are described. Nontrivial examples are given in order to illustrate the usage of these packages. The algorithms are based on a new approach to q-hypergeometric telescoping in which a new algebraic concept, q-greatest factorial factorization (qGFF), plays a fundamental role.
متن کاملA Mathematica q-Analogue of Zeilberger’s Algorithm Based on an Algebraically Motivated Approach to q-Hypergeometric Telescoping
Mathematica implementations, available by email request, of q-analogues of Gosper’s and Zeilberger’s algorithm are described. Nontrivial examples are given in order to illustrate the usage of these packages. The algorithms are based on a new approach to q-hypergeometric telescoping in which a new algebraic concept, q-greatest factorial factorization (qGFF), plays a fundamental role.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1993
ISSN: 0377-0427
DOI: 10.1016/0377-0427(93)90317-5