Generatingfunctionology

Generatingfunctionology
by Herbert S. Wilf

Download Book
(Respecting the intellectual property of others is utmost important to us, we make every effort to make sure we only link to legitimate sites, such as those sites owned by authors and publishers. If you have any questions about these links, please contact us.)

link 1

About Book

SIAM News, October 1994
"This is a first rate, carefully planned and executed book... I’ll be using it the next time I teach…"

The Mathematical Intelligencer, March 1993
"Wilf's writing is clear and friendly; his exorcises are instructive and plentiful..."

Book Description
Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. Generating functions have numerous applications in mathematics, especially in

* Combinatorics
* Probability Theory
* Statistics
* Theory of Markov Chains
* Number Theory

One of the most important and relevant recent applications of combinatorics lies in the development of Internet search engines whose incredible capabilities dazzle even the mathematically trained user.

Comments

SEND A COMMENT

PLEASE READ: All comments must be approved before appearing in the thread; time and space constraints prevent all comments from appearing. We will only approve comments that are directly related to the article, use appropriate language and are not attacking the comments of others.