|
Combinatorial Enumeration
by Ian P. Goulden,David M. Jackson
This graduate-level text presents an encyclopedic account of the mathematical theory and problem-solving techniques associated with enumeration problems. Its approach blends combinatorial and algebraic ideas to offer insights into a wide variety of problems, and each section of the book focuses on a specific discrete structure, advancing from elementary (often classical) results to those at research level. Subjects include the combinatorics of the ordinary generating function and the exponential generating function, the combinatorics of sequences, and the combinatorics of paths. The text is complemented by approximately 350 exercises with full solutions. 1983 edition. Foreword by Gian-Carlo Rota. References. Index.
Table of Contents for Combinatorial Enumeration
| Foreword by Gian-Carlo Rota | | 1. Mathematical Preliminaries | | 2. The Combinatorics of the Ordinary Generating Function | | 3. The Combinatorics of the Exponential Generating Function | | 4. The Combinatorics of Sequences | | 5. The Combinatorics of Paths | | Solutions | | References | | Index |
|
 |
|
|
|