generatingfunctionology
Product Description
generatingfunctionology
- Used Book in Good Condition
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.
Technical Specifications
You might also like
Enumerative Combinatorics (Cambridge Studies in Advanced Mathematics)
Concrete Mathematics: A Foundation for Computer Science (2nd Edition)
Graph Theory and Its Applications (Textbooks in Mathematics)
Combinatorial Problems and Exercises (AMS Chelsea Publishing)
Graph Theory (Graduate Texts in Mathematics)
Algebraic Combinatorics: Walks, Trees, Tableaux, and More (Undergraduate Texts in Mathematics)
Introduction to Enumerative and Analytic Combinatorics (Discrete Mathematics and Its Applications)
Understanding Analysis (Undergraduate Texts in Mathematics)
Infinite Powers: How Calculus Reveals the Secrets of the Universe
Linear Algebra Done Right (Undergraduate Texts in Mathematics)