generatingfunctionology
by Herbert S. Wilf
Publisher: A K Peters, Ltd. 2006
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.
Download or read it online for free here:
Download link
(1.5MB, PDF)
Similar books
Discrete Math for Computer Science Students
by Ken Bogart, Cliff Stein - 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.
(9855 views)
by Ken Bogart, Cliff Stein - 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.
(9855 views)
Introduction To Finite Mathematics
by J. G. Kemeny, J. L. Snell, G. L. Thompson - Prentice-Hall
This book introduces college students to the elementary theory of logic, sets, probability theory, and linear algebra and treats a number of applications either from everyday situations or from applications to the biological and social sciences.
(16223 views)
by J. G. Kemeny, J. L. Snell, G. L. Thompson - Prentice-Hall
This book introduces college students to the elementary theory of logic, sets, probability theory, and linear algebra and treats a number of applications either from everyday situations or from applications to the biological and social sciences.
(16223 views)
Discrete 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.
(15336 views)
- 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.
(15336 views)
Discrete Mathematics: An Open Introduction
by Oscar Levin - 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.
(11190 views)
by Oscar Levin - 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.
(11190 views)