A two-line algorithm for proving q-hypergeometric identities

DOI10.1006/JMAA.1997.5131MaRDI QIDQ1378409zbMATH OpenOpenAlexFDO

Authors Lily Yen

Publication date 9 December 1998

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jmaa.1997.5131

zbMATH Keywords

\(q\)-hypergeometric identities

Mathematics Subject Classification ID

(q)-calculus and related topics (05A30) Basic hypergeometric functions in one variable, ({}_rphi_s) (33D15) Additive difference equations (39A10)

Review text

In an earlier paper [\textit{Y. Lily}, J. Math. Anal. Appl. 198, No. 3, 856-878 (1996; Zbl 0857.33002)] the author showed that hypergeometric identies \(\sum_kF(n,k)=f(n), n\geq n_0\) can be proved by checking a finite number of consecutive values of \(n\), id est for \(n\in\{n_0,n_0+1,\ldots,n_1\}\). Moreover, a first (theoretical) estimate of \(n_1\) was given in terms of the coefficients in \(F(n,k)\). The paper under review can be seen as a \(q\)-analogue of this earlier result. The algorithm is based on the \(q\)-analogue of Zeilberger's construction for proving hypergeometric identities [see \textit{T. H. Koornwinder}, J. Comput. Appl. Math. 48, No. 1-2, 91-111 (1993; Zbl 0797.65011)]. This construction is based on Sister Celine's method [see \textit{D. Zeilberger}, J. Math. Anal. Appl. 85, 114-145 (1982; Zbl 0485.05003) and also the marvellous book of \textit{M. Petkovsek, H. S. Wilf} and \textit{D. Zeilberger}, \(A=B\), Wellesley, MA, A.K. Peters (1996, Zbl 0848.05002)]. The first ``a priori estimate for \(n_1\) is too big and complicated to be of pratical use, but it might be possible that these estimates can be made smaller as the author indicates. More on algorithmic ways of proving hypergeometric identities can be found in [\textit{H. S. Wilf} and \textit{D. Zeilberger}, Invent. Math. 108, 575-634 (1992; Zbl 0782.05009)].

Recommendations

• An improvement of the two-line algorithm for proving \(q\)-hypergeometric identities.
• A two-line algorithm for proving terminating hypergeometric identities
• An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
• Proving hypergeometric identities by numerical verifications

Cites work

• A high-tech proof of the Mills-Robbins-Rumsey determinant formula
• An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
• scientific article; zbMATH DE number 194092 (Why is no real title available?)
• scientific article; zbMATH DE number 3458752 (Why is no real title available?)
• scientific article; zbMATH DE number 3467565 (Why is no real title available?)
• On Zeilberger's algorithm and its \(q\)-analogue
• Some generalized hypergeometric polynomials

Cited in

(8)

• An improvement of the two-line algorithm for proving \(q\)-hypergeometric identities.
• A new elementary algorithm for proving \(q\)-hypergeometric identities
• A two-line algorithm for proving terminating hypergeometric identities
• The colored Jones function is \(q\)-holonomic
• scientific article; zbMATH DE number 1023404 (Why is no real title available?)
• Creative telescoping for holonomic functions
• An example of A₂ Rogers-Ramanujan bipartition identities of level 3
• Proving hypergeometric identities by numerical verifications

This page was built for publication: A two-line algorithm for proving \(q\)-hypergeometric identities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1378409)