Logo

generatingfunctionology by Herbert S. Wilf

Large book cover: generatingfunctionology

generatingfunctionology
by

Publisher: A K Peters, Ltd.
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.

Home page url

Download or read it online for free here:
Download link
(1.5MB, PDF)

Similar books

Book cover: Topics in Discrete MathematicsTopics in Discrete Mathematics
by - Harvey Mudd College
This text is an introduction to a selection of topics in discrete mathematics: Combinatorics; The Integers; The Discrete Calculus; Order and Algebra; Finite State Machines. The prerequisites include linear algebra and computer programming.
(5503 views)
Book cover: Discrete MathematicsDiscrete Mathematics
by - Macquarie University
Logic and sets, the natural numbers, division and factorization, languages, finite state machines, finite state automata, Turing machines, groups and modulo arithmetic, introduction to coding theory, group codes, public key cryptography, etc.
(22622 views)
Book cover: Discrete Mathematics: An Open IntroductionDiscrete Mathematics: An Open Introduction
by - University of Northern Colorado
This book was written to be used as the primary text for introduction to proof, as well as an introduction to topics in discrete mathematics. Contents: Counting; Sequences; Symbolic Logic and Proofs; Graph Theory; Generating Functions; and more.
(3317 views)
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.
(9937 views)