Generatingfunctionology
Herbert S. Wilf · 2005 · 192 pages
As an Amazon Associate we earn from qualifying purchases. Some book links are affiliate links; you pay the same price and we may earn a small commission.
About this book
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.
Appears in these reading paths
Learn combinatorics: the best books to read in order
Discrete mathematics: books for logic, proofs, and counting
Reader reviews
Ratings and notes from readers — tagged with how deep into the subject they were.
Loading reviews…