Record Display for the EPA National Library Catalog


OLS Field Name OLS Field Data
Main Title A=B /
Author Petkovések, Marko.
Other Authors
Author Title of a Work
Wilf, Herbert S.,
Zeilberger, Doron.
Knuth, Donald Ervin,
Publisher A K Peters,
Year Published 1996
OCLC Number 33898705
ISBN 1568810636; 9781568810638
Subjects Combinatorial identities--Data processing. ; Algoritmos e estruturas de dados.
Internet Access
Description Access URL
Table of contents
Library Call Number Additional Info Location Last
EKDM  QA164.9.P48 1996 CEMM/EPD Library/Athens,GA 11/26/2012
Collation xii, 212 p. : ill. ; 24 cm.
Includes bibliographical references (p. [201]-208) and index.
Contents Notes
In the area of combinatorial identities computers are able to find very elegant proofs of difficult theorems unassisted by human intervention. This autonomy means that not only is it possible to use a PC to find such a proof, but also the proof can be checked easily. This book shows how several recently developed computer algorithms can master the difficult job of simplifying complex summations and if there is no such simplification they will prove this to be the case. The authors present the underlying mathematical theory of these methods, the principle theorems and proofs, and include a package of computer programs that can do these tasks. I. Background. 1. Proof Machines. 2. Tightening the Target. 3. The Hypergeometric Database -- II. The Five Basic Algorithms. 4. Sister Celine's Method. 5. Gosper's Algorithm. 6. Zeilberger's Algorithm. 7. The WZ Phenomenon. 8. Algorithm Hyper -- III. Epilogue. 9. An Operator Algebra Viewpoint -- A: The WWW sites and the software