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

by

**Al Doerr, Ken Levasseur**-

**Lulu.com**

Applied Discrete Structures is a two semester undergraduate text in discrete mathematics, focusing on the structural properties of mathematical objects. These include matrices, functions, graphs, trees, lattices and algebraic structures.

(

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

(

**9757**views)

**Discrete Differential Geometry: An Applied Introduction**

by

**M. Desbrun, P. Schroeder, M. Wardetzky**-

**Columbia University**

This new and elegant area of mathematics has exciting applications, as this text demonstrates by presenting practical examples in geometry processing (surface fairing, parameterization, and remeshing) and simulation (of cloth, shells, rods, fluids).

(

**11654**views)

**Lists, Decisions, and Graphs**

by

**Edward A. Bender, S. Gill Williamson**-

**University of California, San Diego**

In this book, four basic areas of discrete mathematics are presented: Counting and Listing, Functions, Decision Trees and Recursion, and Basic Concepts in Graph Theory. At the end of each unit is a list of Multiple Choice Questions for Review.

(

**3888**views)