- S'inscrire
- |
- Mon compte
- |
- Newsletter
- |
- Aide
Generatingfunctionology
- Auteur(s) : Herbert S. Wilf
- Editeur : AK Peters
-
Nombre de pages : 246 pages
- Date de parution : 27/02/2006 (3e édition)
Résumé
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
- 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.
Sommaire
- Preface
- Introductory Ideas and Examples
- Series
- Cards, Decks, and Hands: The Exponential Formula
- Applications of Generating Functions
- Analytic and Asymptotic Methods
- A: Using Maple and Mathematica
- Solutions
- References
- Index
Caractéristiques
|
|











Devenez Fan !
Suivez-nous sur Twitter