THE FOLD / GRIND / THE EPOCH / THE STIRLING
THE STIRLING
count set partitions — and translate powers to falling factorials
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
The Stirling numbers of the second kind S(n,k) count the ways to partition a set of n labelled items into exactly k non-empty, unordered blocks. Where a binomial coefficient chooses, Stirling numbers group, and the recurrence tells the whole story: a new item either joins one of the k existing blocks (k·S(n−1,k) ways) or starts a fresh block (S(n−1,k−1) ways).
Sum a row over all k and you get the Bell number Bₙ — the total number of ways to partition the set at all.
LIT verified live: the recurrence matches a brute count of set partitions into k blocks for n=1…7, each row sums to the Bell number, and the basis identity xⁿ = Σk S(n,k)·(x)k holds exactly (window.__stirling). FIG no framing; exact combinatorial counting.
Sum a row over all k and you get the Bell number Bₙ — the total number of ways to partition the set at all.
LIT verified live: the recurrence matches a brute count of set partitions into k blocks for n=1…7, each row sums to the Bell number, and the basis identity xⁿ = Σk S(n,k)·(x)k holds exactly (window.__stirling). FIG no framing; exact combinatorial counting.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this at the-epoch — sorting the long list of an age into groups. Stirling numbers are that grouping, counted. AVAN (AI) built the instrument: the recurrence, the brute set-partition enumeration, the Bell-number row sum, and the falling-factorial basis identity.
Credit as content: James Stirling (Methodus Differentialis, 1730). The weave: David names the epoch; I count set partitions two ways — recurrence and enumeration — and reveal that the same numbers translate between ordinary powers and falling factorials.
Credit as content: James Stirling (Methodus Differentialis, 1730). The weave: David names the epoch; I count set partitions two ways — recurrence and enumeration — and reveal that the same numbers translate between ordinary powers and falling factorials.
3 ONE DIMENSION
A set split into blocks. The recurrence in a picture: the newest item (red) either drops into one of the existing blocks, or opens a brand-new one — the two terms k·S(n−1,k) and S(n−1,k−1).
4 TWO DIMENSIONS · INTERACTIVE
Pick n. The instrument computes the Stirling row by recurrence and by brute-enumerating set partitions, confirms they agree, and checks the row sums to the Bell number.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: the Stirling triangle, each entry a count of set partitions into k blocks.
AVAN’s addition (the inverse-companion): the same numbers that count groupings are a change of basis between two ways of writing polynomials. Ordinary powers xⁿ expand exactly into falling factorials (x)k = x(x−1)…(x−k+1) with Stirling coefficients: xⁿ = Σk S(n,k)·(x)k. So a purely combinatorial identity (how many partitions) is also a purely linear-algebraic one (the dictionary between two polynomial bases). The inverse of ‘counting how to group a set’ is ‘translating between how you spell a polynomial.’ Magenta is the power basis xⁿ; green is the falling-factorial basis; the Stirling numbers are the exact translation between them. Counting and coordinates are the same table read two ways.
LIT Genuine Stirling numbers of the second kind (Stirling, Methodus Differentialis 1730). Verified live: S(n,k)=k*S(n-1,k)+S(n-1,k-1) matches a brute count of set partitions into k blocks for n=1..7, each row sums to the Bell number, and the identity x^n = sum_k S(n,k)*x(x-1)...(x-k+1) holds exactly for integer x (window.__stirling); S(5,k)=1,15,25,10,1, Bell(5)=52.
FIG No framing: the recurrence, the brute set-partition enumeration, the Bell-number row sum, and the falling-factorial basis identity all compute in-browser and agree exactly. The AVAN inverse is honest — the Stirling numbers are genuinely the change-of-basis matrix between the power basis and the falling-factorial basis, so a combinatorial count is literally a linear-algebra coordinate translation.
FIG No framing: the recurrence, the brute set-partition enumeration, the Bell-number row sum, and the falling-factorial basis identity all compute in-browser and agree exactly. The AVAN inverse is honest — the Stirling numbers are genuinely the change-of-basis matrix between the power basis and the falling-factorial basis, so a combinatorial count is literally a linear-algebra coordinate translation.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of THE EPOCH · David Lee Wise (ROOT0), with AVAN