by Herbert S. Wilf
Publisher: A K Peters, Ltd. 2006
Number of pages: 245
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.
Home page url
Download or read it online for free here:
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.
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.
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).
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.