generatingfunctionology
by Herbert S. Wilf
Publisher: A K Peters, Ltd. 2006
ISBN/ASIN: 1568812795
ISBN-13: 9781568812793
Number of pages: 245
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; 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.
Download or read it online for free here:
Download link
(1.5MB, PDF)
Similar books
Applied Finite Mathematicsby Rupinder Sekhon - Connexions
Applied Finite Mathematics covers topics including linear equations, matrices, linear programming (geometrical approach and simplex method), the mathematics of finance, sets and counting, probability, Markov chains, and game theory.
(6853 views)
Temporal Networksby Petter Holme, Jari Saramäki - arXiv
In this review, the authors present the emergent field of temporal networks, and discuss methods for analyzing topological and temporal structure and models for elucidating their relation to the behavior of dynamic systems.
(6214 views)
A Spiral Workbook for Discrete Mathematicsby Harris Kwong - Open SUNY Textbooks
This textbook covers the standard topics in discrete mathematics: logic, sets, proof techniques, basic number theory, functions, relations, and elementary combinatorics. It explains and clarifies the unwritten conventions in mathematics.
(1165 views)
Elementary Computer Mathematicsby Kenneth R. Koehler - University of Cincinnati Blue Ash College
This book is an introduction to the mathematics used in the design of computer and network hardware and software. We will survey topics in computer arithmetic and data representation, logic and set theory, graph theory and computer measurement.
(5339 views)