Wilf Generatingfunctionology

1. Auflage 2014
ISBN: 978-1-4832-7663-2
Verlag: Elsevier Science & Techn.
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 192 Seiten, Web PDF

Generatingfunctionology provides information pertinent to generating functions and some of their uses in discrete mathematics. This book presents the power of the method by giving a number of examples of problems that can be profitably thought about from the point of view of generating functions. Organized into five chapters, this book begins with an overview of the basic concepts of a generating function. This text then discusses the different kinds of series that are widely used as generating functions. Other chapters explain how to make much more precise estimates of the sizes of the coefficients of power series based on the analyticity of the function that is represented by the series. This book discusses as well the applications of the theory of generating functions to counting problems. The final chapter deals with the formal aspects of the theory of generating functions. This book is a valuable resource for mathematicians and students.

Autoren/Hrsg.

Wilf, Herbert S.

Inhaltsverzeichnis

1;Front Cover;1
2;Generatingfunctionology;4
3;Copyright Page;5
4;Table of Contents;8
5;Preface;6
6;Chapter 1. Introductory Ideas and Examples;10
6.1;1.1 An easy two term recurrence;12
6.2;1.2 A slightly harder two term recurrence;14
6.3;1.3 A three term recurrence;17
6.4;1.4 A three term boundary value
problem;19
6.5;1.5 Two independent variables;21
6.6;1.6 Another 2-variable case;26
6.7;Exercises;34
7;Chapter 2. Series;36
7.1;2.1 Formal power series;36
7.2;2.2 The calculus of formal ordinary power series
generating functions;39
7.3;2.3 The calculus of formal exponential generating functions;45
7.4;2.4 Power series, analytic theory;52
7.5;2.5 Some useful power series;58
7.6;2.6 Dirichlet series, formal theory;61
7.7;Exercises;68
8;Chapter 3. Cards, Decks, and Hands:
The Exponential Formula;73
8.1;3.1 Introduction;73
8.2;3.2 Definitions and a question;74
8.3;3.3 Examples of exponential families;76
8.4;3.4 The main counting theorems;78
8.5;3.5 Permutations and their cycles;81
8.6;3.6 Set partitions;83
8.7;3.7 A subclass of permutations;84
8.8;3.8 Involutions, etc;84
8.9;3.9 2-regular Graphs;85
8.10;3.10 Counting connected graphs;86
8.11;3.11 Counting labeled bipartite graphs;87
8.12;3.12 Counting labeled trees;89
8.13;3.13 Exponential families and polynomials of
'binomial type.';91
8.14;3.14 Unlabeled cards and hands;92
8.15;3.15 The money changing problem;96
8.16;3.16 Partitions of integers;100
8.17;3.17 Rooted trees and forests;102
8.18;3.18 Historical notes;103
8.19;Exercises;104
9;Chapter 4. Applications of Generating Functions;107
9.1;4.1 Generating functions find averages, etc;107
9.2;4.2 A generatingfunctionological view of the sieve method;109
9.3;4.3 The 'Snake Oil' method for easier combinatorial identities;117
9.4;4.4 WZ pairs prove harder identities;129
9.5;4.5 Generating functions and unimodality, convexity, etc;135
9.6;4.6 Generating functions prove congruences;139
9.7;Exercises;141
10;Chapter 5. Analytic and Asymptotic Methods;147
10.1;5.1 The Lagrange Inversion Formula;147
10.2;5.2 Analyticity and asymptotics (I): Poles;151
10.3;5.3 Analyticity and asymptotics (II): Algebraic singularities;157
10.4;5.4 Analyticity and asymptotics (III): Hayman's method;161
10.5;Exercises;168
11;Solutions;172
12;References;190
13;Index;192