Generatingfunctionology
Author(s)
Bibliographic Information
Generatingfunctionology
A. K. Peters, c2006
3rd ed
Available at / 14 libraries
-
No Libraries matched.
- Remove all filters.
Note
Some copies published by : Boca Raton : CRC Press
Includes bibliographical references (p. 239-242) and index
Description and Table of Contents
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.
Table of Contents
Introductory Ideas and Examples. Series. Cards, Decks and Hands: The Exponential Formula. Applications of Generating Functions. Analytic and Asymptotic Models. Appendix: Using Maple and Mathematica Solutions. References.
by "Nielsen BookData"
