**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

**A Spiral Workbook for Discrete Mathematics**

by

**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.

(

**620**views)

**Applied Finite Mathematics**

by

**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.

(

**6267**views)

**Languages and Machines**

by

**C. D. H. Cooper**-

**Macquarie University**

This is a text on discrete mathematics. It includes chapters on logic, set theory and strings and languages. There are some chapters on finite-state machines, some chapters on Turing machines and computability, and a couple of chapters on codes.

(

**12458**views)

**Notes on Discrete Mathematics**

by

**Miguel A. Lerma**

Summary of the course CS 310: Mathematical Foundations of Computer Science. It covers concepts of discreet mathematics and applications to computer science, logic and Boolean circuits, functions, sets, relations, databases, finite automata, and more.

(

**13421**views)