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

**Discrete Structures**

by

**Vladlen Koltun**-

**Stanford University**

Contents: Sets and Notation; Induction; More Proof Techniques; Divisibility; Prime Numbers; Modular Arithmetic; Relations and Functions; Mathematical Logic; Counting; Binomial Coefficients; Inclusion-Exclusion Principle; Pigeonhole Principle; etc.

(

**8300**views)

**Exploring Discrete Mathematics Using Maple**

by

**Kenneth H. Rosen**-

**Mcgraw-Hill College**

This is a guide to help you explore concepts in discrete mathematics using the computer system Maple. It is designed to be accessible to those who are complete novices with Maple and with computer programming, but it has much to offer even experts.

(

**4677**views)

**Advances in Discrete Differential Geometry**

by

**Alexander I. Bobenko (ed.)**-

**Springer**

This is the book on a newly emerging field of discrete differential geometry. It surveys the fascinating connections between discrete models in differential geometry and complex analysis, integrable systems and applications in computer graphics.

(

**3692**views)

**Discrete Mathematics with Algorithms**

by

**M. O. Albertson, J. P. Hutchinson**-

**J. Wiley**

This first-year course in discrete mathematics requires no calculus or computer programming experience. The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs...

(

**5672**views)