Abstract
We give a simple proof of George Andrews’s balanced 5 F 4 evaluation using two fundamental principles: the nth difference of a polynomial of degree less than n is zero, and a polynomial of degree n that vanishes at n+1 points is identically zero.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Andrews, G.E.: Pfaff’s method. I. The Mills–Robbins–Rumsey determinant. Discrete Math. 193, 43–60 (1998)
Andrews, G.E.: Pfaff’s method. III. Comparison with the WZ method. Electron. J. Comb. 3(2), 21 (1996), 18 pp.
Andrews, G.E., Stanton, D.W.: Determinants in plane partition enumeration. Eur. J. Comb. 19, 273–282 (1998)
Chu, W.: Inversion techniques and combinatorial identities: balanced hypergeometric series. Rocky Mt. J. Math. 32, 561–587 (2002)
Ekhad, S.B., Zeilberger, D.: Curing the Andrews syndrome. J. Differ. Equ. Appl. 4, 299–310 (1998)
Stanton, D.: A hypergeometric hierarchy for the Andrews evaluations. Ramanujan J. 2, 499–509 (1998)
Verma, A., Jain, V.K., Jain, S.: Some summations and transformations of balanced hypergeometric series. Indian J. Pure Appl. Math. 40, 235–251 (2009)
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to the memory of Basil Gordon
This work was partially supported by grant #229238 from the Simons Foundation.
Rights and permissions
About this article
Cite this article
Gessel, I.M. A simple proof of Andrews’s 5 F 4 evaluation. Ramanujan J 36, 165–170 (2015). https://doi.org/10.1007/s11139-013-9517-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11139-013-9517-8