generatingfunctionology by Herbert S. Wilf

Large book cover: generatingfunctionology


Publisher: A K Peters, Ltd.
ISBN/ASIN: 1568812795
ISBN-13: 9781568812793
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:
Download link
(1.5MB, PDF)

Similar books

Book cover: Notes on Discrete MathematicsNotes on Discrete Mathematics
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.
Book cover: Mathematics for Computer ScienceMathematics for Computer Science
by - MIT
An introduction to discrete mathematics oriented toward Computer Science and Engineering. Topics covered: Fundamental concepts of Mathematics: sets, functions, number theory; Discrete structures: graphs, counting; Discrete probability theory.
Book cover: Discrete Math for Computer Science StudentsDiscrete Math for Computer Science Students
by - Dartmouth College
It gives thorough coverage to topics that have great importance to computer scientists and provides a motivating computer science example for each math topic. Contents: Counting; Cryptography and Number Theory; Reflections on Logic and Proof.
Book cover: Discrete Mathematics for Computer ScienceDiscrete Mathematics for Computer Science
by - arXiv
These are notes on discrete mathematics for computer scientists. The presentation is somewhat unconventional. I emphasize partial functions more than usual, and I provide a fairly complete account of the basic concepts of graph theory.