A = B

1. Auflage 2019
ISBN: 978-0-367-44871-4
Verlag: Taylor & Francis Ltd

Buch, Englisch, 230 Seiten, Format (B × H): 150 mm x 210 mm, Gewicht: 381 g

This book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics. It presents a breakthrough method for analyzing complex summations. Beautifully written, the book contains practical applications as well as conceptual developments that will have applications in other areas of mathematics.

From the table of contents: * Proof Machines * Tightening the Target * The Hypergeometric Database * The Five Basic Algorithms: Sister Celine's Method, Gosper&'s Algorithm, Zeilberger's Algorithm, The WZ Phenomenon, Algorithm Hyper * Epilogue: An Operator Algebra Viewpoint * The WWW Sites and the Software (Maple and Mathematica) Each chapter contains an introduction to the subject and ends with a set of exercises.

Zielgruppe

Academic and Professional Practice & Development

Autoren/Hrsg.

Petkovsek, Marko

Wilf, Herbert S

Zeilberger, Doron

Fachgebiete

• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle
• Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik

Inhaltsverzeichnis

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

Über Autor(innen)

Petkovsek, Marko; Wilf, Herbert S; Zeilberger, Doron