Record ID | marc_columbia/Columbia-extract-20221130-031.mrc:250175470:5502 |
Source | marc_columbia |
Download Link | /show-records/marc_columbia/Columbia-extract-20221130-031.mrc:250175470:5502?format=raw |
LEADER: 05502cam a2200637Mi 4500
001 15130942
005 20220627133329.0
006 m o d
007 cr cn|||||||||
008 180306s1996 flu ob 001 0 eng d
035 $a(OCoLC)on1027754244
035 $a(NNC)15130942
040 $aCRCPR$beng$erda$epn$cCRCPR$dOCLCO$dOCLCF$dOCLCQ$dOCLCO$dEBLCP$dYDX$dN$T$dMERUC$dOCLCQ$dOTZ$dTYFRS$dOCLCQ$dK6U$dOCLCO
019 $a1021214858
020 $a9781439864500$q(e-book)
020 $a1439864500
020 $z1568810636
020 $z9781568810638
024 7 $a10.1201/9781439864500$2doi
035 $a(OCoLC)1027754244$z(OCoLC)1021214858
050 4 $aQA164.9.P48 1996
072 7 $aMAT003000$2bisacsh
072 7 $aMAT036000$2bisacsh
082 04 $a511.3/0285/51
049 $aZCUA
100 1 $aPetkovsek, Marko,$eauthor.
245 12 $aA =$bB /$cMarko Petkovsek, Herbert S Wilf, Doron Zeilberger.
250 $aFirst edition.
264 1 $aBoca Raton, FL :$bCRC Press,$c1996.
300 $a1 online resource :$btext file, PDF
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
520 2 $a"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."--Provided by publisher.
505 0 $aCover; Half Title; Title Page; Copyright Page; Table of Contents; Foreword; A Quick Start; I: Background; 1: Proof Machines; 1.1 Evolution of the province of human thought; 1.2 Canonical and normal forms; 1.3 Polynomial identities; 1.4 Proofs by example?; 1.5 Trigonometric identities; 1.6 Fibonacci identities; 1.7 Symmetric function identities; 1.8 Elliptic function identities; 2: Tightening the Target; 2.1 Introduction; 2.2 Identities; 2.3 Human and computer proofs; an example; 2.4 A Mathematica session; 2.5 A Maple session; 2.6 Where we are and what happens next; 2.7 Exercises.
505 8 $a3: The Hypergeometric Database3.1 Introduction; 3.2 Hypergeometric series; 3.3 How to identify a series as hypergeometric; 3.4 Software that identifies hypergeometric series; 3.5 Some entries in the hypergeometric database; 3.6 Using the database; 3.7 Is there really a hypergeometric database?; 3.8 Exercises; II: The Five Basic Algorithms; 4: Sister Celine's Method; 4.1 Introduction; 4.2 Sister Mary Celine Fasenmyer; 4.3 Sister Celine's general algorithm; 4.4 The Fundamental Theorem; 4.5 Multivariate and ""q"" generalizations; 4.6 Exercises; 5: Gosper's Algorithm; 5.1 Introduction.
505 8 $a5.2 Hypergeometrics to rationals to polynomials5.3 The full algorithm: Step 2; 5.4 The full algorithm: Step 3; 5.5 More examples; 5.6 Similarity among hypergeometric terms; 5.7 Exercises; 6: Zeilberger's Algorithm; 6.1 Introduction; 6.2 Existence of the telescoped recurrence; 6.3 How the algorithm works; 6.4 Examples; 6.5 Use of the programs; 6.6 Exercises; 7: The WZ Phenomenon; 7.1 Introduction; 7.2 WZ proofs of the hypergeornetric database; 7.3 Spinoffs from the WZ method; 7.4 Discovering new hypergeometric identities; 7.5 Software for the WZ method; 7.6 Exercises; 8: Algorithm Hyper.
505 8 $a8.1 Introduction8.2 The ring of sequences; 8.3 Polynomial solutions; 8.4 Hyper geometric solutions; 8.5 A Mathematica session; 8.6 Finding all hypergeometric solutions; 8.7 Finding all closed form solutions; 8.8 Some famous sequences that do not have closed form; 8.9 Inhomogeneous recurrences; 8.10 Factorization of operators; 8.11 Exercises; III: Epilogue; 9: An Operator Algebra Viewpoint; 9.1 Early history; 9.2 Linear difference operators; 9.3 Elimination in two variables; 9.4 Modified elimination problem; 9.5 Discrete holonomic functions; 9.6 Elimination in the ring of operators.
505 8 $a9.7 Beyond the holonomic paradigm9.8 Bi-basic equations; 9.9 Creative anti-symmetrizing; 9.10 Wavelets; 9.11 Abel-type identities; 9.12 Another semi-holonomic identity; 9.13 The art; 9.14 Exercises; A: The WWW sites and the software; A.1 The Maple packages EKHAD and qEKHAD; A.2 Mathematica programs; Bibliography; Index.
504 $aIncludes bibliographical references and index.
650 0 $aMathematics.
650 0 $aCombinatorial analysis.
650 6 $aMathématiques.
650 6 $aAnalyse combinatoire.
650 7 $amathematics.$2aat
650 7 $aapplied mathematics.$2aat
650 7 $aMATHEMATICS$xGeneral.$2bisacsh
650 7 $aCombinatorial analysis.$2fast$0(OCoLC)fst00868961
650 7 $aMathematics.$2fast$0(OCoLC)fst01012163
655 0 $aElectronic books.
655 4 $aElectronic books.
700 1 $aWilf, Herbert S,$eauthor.
700 1 $aZeilberger, Doron,$eauthor.
776 08 $z9781439864500$z9781568810638
856 40 $uhttp://www.columbia.edu/cgi-bin/cul/resolve?clio15130942$zTaylor & Francis eBooks
852 8 $blweb$hEBOOKS