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: 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.
(2602 views)
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.
(11215 views)
Book cover: Discrete MathematicsDiscrete Mathematics
- Wikibooks
Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. This book will help you think well about discrete problems: problems where tools like calculus fail because there's no continuity.
(8947 views)
Book cover: Discrete Mathematics with AlgorithmsDiscrete Mathematics with Algorithms
by - 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...
(4101 views)