Deep Dive: John Riordan’s An Introduction to Combinatorial Analysis – Why It’s a Cult Classic and Where to Find It
Get a used copy of the 1958 Wiley edition from AbeBooks or a library discard. It has a wonderful vintage aesthetic and the paper is often nicer than modern reprints. A Sample Passage to Gauge Difficulty Here’s a typical line from Chapter 2 (on the sieve): “The number of ways of assigning n balls to n cells with no cell empty is, of course, n!; the number with exactly m cells empty is S(n, n-m), where S(n, k) is a Stirling number of the second kind. Hence the number with no cell empty, which is the number of onto functions, is n! = Σ_{k=0}^n (-1)^{n-k} * C(n, k) * k^n.” If that sentence makes sense and excites you, Riordan is your book. If it looks like hieroglyphics, start elsewhere. Conclusion John Riordan’s An Introduction to Combinatorial Analysis is a monument to mid-20th-century enumeration. It’s difficult, rewarding, and unlike any modern textbook. The PDF is widely available but often ugly; the physical book is a pleasure to own but costly. Either way, if you want to master generating functions, finite differences, and combinatorial inversion, you eventually have to wrestle with Riordan. introduction to combinatorial analysis riordan pdf
Given the frequent search for a “Riordan PDF,” it’s clear that this book remains in high demand despite being over six decades old. Let’s break down what this book is, why it still matters, and the practicalities of finding a digital copy. Most combinatorics books fall into two camps: enumeration (counting) or graph theory. Riordan’s book is almost exclusively enumeration , but with a very specific flavor: generating functions and inversion . Deep Dive: John Riordan’s An Introduction to Combinatorial
Where a modern text might say, “Use the principle of inclusion-exclusion,” Riordan shows you how to translate the entire problem into a functional equation and then solve it using formal power series. The book is a bridge between 19th-century combinatorial analysis (think Whitworth, MacMahon) and the emerging 20th-century algebraic combinatorics. Hence the number with no cell empty, which