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; and 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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!