Abstract
We revisit Peter Henrici’s friendly monster identity to present a case study on Egorychev’s method. Connections to various computer algebra approaches are drawn.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G. E. Andrews, R. Askey, and R. Roy, Special Functions, Cambridge University Press, 1999.
W. N. Bailey, Products of generalized hypergeometric series, Proc. London Math. Soc. 28 (1928), 242–254.
G. P. Egorychev, Integral Representation and the Computation of Combinatorial Sums, Translations of Mathematical Monographs, Vol. 59, Amer. Math. Soc., Providence, RI, 1984. (Translation of: Integral’noe predstavlenie i vychislenie kombinatornykh summ.)
R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics, 1st edition, Addison-Wesley, 1989.
R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics, 2nd edition, Addison-Wesley, 1994.
G. N. Han, A general algorithm for the MacMahon Operator, Ann. of Comb. 7 (2003), 467–480.
P. Henrici, De Branges’ proof of the Bieberbach conjecture: a view from computational analysis, Sitzungsber. der Berliner Math. Ges. (1987), 105–121.
P. Henrici, A triple product theorem for hypergeometric series, SIAM J. Math. Anal. 18 (1987), 1513–1518.
C. Mallinger, Algorithmic Manipulations and Transformations of Univariate Holonomic Functions and Sequences, Master’s Thesis (Diplomarbeit), RISC, Johannes Kepler University Linz, 1996. Available at: http://www.risc.uni-linz.ac.at/research/combinat.
B. Salvy and P. Zimmermann, Gfun: a package for the manipulation of generating and holonomic functions in one variable, ACM Trans. Math. Software 20 (1994), 163–177.
R. P. Stanley, Enumerative Combinatorics Vol. 2, Cambridge University Press, 1999.
K. Wegschaider, Computer Generated Proofs of Binomial Multi-Sum Identities, Master’s Thesis (Diplomarbeit), RISC, Johannes Kepler University Linz, 1997. Available at: http://www.risc.uni-linz.ac.at/research/combinat.
H. S. Wilf and D. Zeilberger, An algorithmic proof theory for hypergeometric (ordinary and “q”) multisum/integral identities, Inventiones Math. 108 (1992), 575–633.
D. Zeilberger, A fast algorithm for proving terminating hypergeometric identities, Discrete Math. 80 (1982), 207–211.
G. E. Andrews and P. Paule, MacMahon’s Partition Analysis IV: Hypergeometric multisums, Séminaire Lotharingien de Combinatoire 42 (1998), Paper B42i. (Also in: The Andrews Festschrift: Seventeen Papers on Classical Number Theory and Combinatorics, D. Foata and G.-N. Han, eds., pp. 189–208. Berlin, Springer, 2001.)
G. E. Andrews, P. Paule and A. Riese, MacMahon’s Partition Analysis VI: A new reduction algorithm, Annals Combin. 5 (2002), 251–270.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paule, P. (2009). Henrici’s Friendly Monster Identity Revisited. In: Kotsireas, I., Zima, E. (eds) Advances in Combinatorial Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03562-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-03562-3_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03561-6
Online ISBN: 978-3-642-03562-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)