Generatingfunctionology: Third Edition

Front Cover
Taylor & Francis, 2006 - Computers - 245 pages
0 Reviews
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.

What people are saying - Write a review

We haven't found any reviews in the usual places.

References to this book

All Book Search results »

Bibliographic information