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: Advances in Discrete Differential GeometryAdvances in Discrete Differential Geometry
by - 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.
(2411 views)
Book cover: Elementary Computer MathematicsElementary Computer Mathematics
by - University of Cincinnati Blue Ash College
This book is an introduction to the mathematics used in the design of computer and network hardware and software. We will survey topics in computer arithmetic and data representation, logic and set theory, graph theory and computer measurement.
(6069 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.
(2862 views)
Book cover: Notes on Discrete MathematicsNotes on Discrete Mathematics
by
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.
(14685 views)