Home
»
= B
Regular price
€78.99
603 verified reviews
100% verified
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
Shipping & Delivery
Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock
14-28 Working Days: On Backorder
Will Deliver When Available: On Pre-Order or Reprinting
We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!
Close
A01=Doron Zeilberger
A01=Herbert S Wilf
A01=Marko Petkovsek
advanced combinatorics textbook
algorithmic proof methods
Author_Doron Zeilberger
Author_Herbert S Wilf
Author_Marko Petkovsek
bases
Binomial Coefficients
Category=PB
Category=PBV
Category=PBW
coefficients
combinatorial algorithms
Companion Identity
Computer Algebra Program
discrete summation techniques
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Exponential Generating Function
finite mathematics
function
General Companion Identity
grobner
hypergeometric
Hypergeometric Identities
Hypergeometric Polynomials
Hypergeometric Series
Hypergeometric Terms
Linear Recurrence
Linear Recurrence Equation
Maple Code
Nonnegative Integer
Nonpositive Integer
operator algebra applications
ple
polynomial
Polynomial Coefficients
Polynomial Solution
Proof Machines
rational
Rational Function
Recurrence Operator
Recurrence Relation
Ro Lla Ry
series
symbolic computation
Vice Versa
WZ Method
xam
Xam Ple
Zeilberger's Algorithm
Zeilberger’s Algorithm
Product details
- ISBN 9780367448714
- Weight: 400g
- Dimensions: 191 x 235mm
- Publication Date: 02 Dec 2019
- Publisher: Taylor & Francis Ltd
- Publication City/Country: GB
- Product Form: Paperback
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.
Petkovsek, Marko; Wilf, Herbert S; Zeilberger, Doron
= B
€78.99
