generatingfunctionology, Second Edition
|
generatingfunctionology, Second Edition
|
This is the Second Edition of the highly successful introduction to the use of generating functions and series in combinatorial mathematics. This new edition includes several new areas of application, including the cycle index of the symmetric group, permutations and square roots, counting polyominoes, and exact covering sequences. An appendix on using the computer algebra programs MAPLE(r) and Mathematica(r) to generate functions is also included. The book provides a clear, unified introduction to the basic enumerative applications of generating functions, and includes exercises and solutions, many new, at the end of each chapter.
Key Features
* Provides new applications on the cycle index of the symmetric group, permutations and square roots, counting polyominoes, and exact covering sequences
* Features an Appendix on using MAPLE(r) and Mathematica (r) to generate functions
* Includes many new exercises with complete solutions at the end of each chapter

20/09/2005
Interested readers should be made aware that if a person does a net search for "Herbert Wilf's Home Page", and then goes to that site, the author has this book (and a number of other things)available for FREE downloading. That might be a great way to preview the book, even if you later decide to spend the money to get a nicely bound traditional copy here.

22/12/2002
Generatingfunctionology is, in my opinion, one of the best mathematics books ever written. If you want to read one mathematics book that really makes a difference, this is it! I read the book twice, and I plan to read it again. I went from being rather inept at solving combinatorial problems to being a virtual "master" almost overnight! Wilf's writing style is clear, concise, and even humorous at times. Reading this book is like being blind and then having your eyes opened for the first time. Generating functions are an extremely powerful tool in number theory and combinatorics. Don't pass up this book! You may never become an Euler, but you sure can come close!
Your Name:
Your Review: Note: HTML is not translated!
Rating: Bad Good
Enter the code in the box below:











