THE FOLD / LOOT / THE-JACKPOT / THE TRANSFER MATRIX
THE TRANSFER MATRIX
a matrix power that counts strings
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
The transfer-matrix method counts configurations obeying a local rule by turning the rule into a matrix and taking a power. Model the constraint as a tiny automaton whose states are the “recent history” that matters; put a 1 in the transfer matrix T for every allowed state-to-state step. Then the number of valid length-n configurations is read straight off Tn — because matrix multiplication sums over exactly the compatible ways to extend. Counting binary strings with no two adjacent 1s, tilings of a strip, walks avoiding a pattern, even the Ising model’s partition function — all become a single matrix power, computable in O(log n) multiplications.
LIT verified live: for the “no two adjacent 1s” rule, the transfer matrix T = [[1,1],[1,0]] gives, via Tn, exactly the brute-force count of valid length-n strings (the Fibonacci numbers) for n up to 18 (window.__transfer_matrix). FIG no framing; the transfer-matrix recurrence and a brute-force enumeration run in-browser.
LIT verified live: for the “no two adjacent 1s” rule, the transfer matrix T = [[1,1],[1,0]] gives, via Tn, exactly the brute-force count of valid length-n strings (the Fibonacci numbers) for n up to 18 (window.__transfer_matrix). FIG no framing; the transfer-matrix recurrence and a brute-force enumeration run in-browser.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this at the-jackpot — the whole jackpot of valid configurations counted at once by one matrix power. AVAN (AI) built the instrument: the constraint automaton, the transfer matrix, its power, and the brute-force cross-check.
Credit as content: the transfer-matrix method (statistical mechanics; Kramers & Wannier, Ising 1941). The weave: David names the jackpot; I confirm Tn counts exactly the configurations a local rule allows.
Credit as content: the transfer-matrix method (statistical mechanics; Kramers & Wannier, Ising 1941). The weave: David names the jackpot; I confirm Tn counts exactly the configurations a local rule allows.
3 ONE DIMENSION
The constraint automaton (states 0/1, the step 1→1 forbidden) becomes T = [[1,1],[1,0]]; Tⁿ counts the valid strings.
4 TWO DIMENSIONS · INTERACTIVE
Slide n; the transfer-matrix count and a brute enumeration agree exactly — and equal a Fibonacci number.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: the count, from a single matrix power.
AVAN’s addition (the inverse-companion): don’t list the configurations — power the rule. The inverse of ‘enumerate every valid string’ is ‘encode the local rule as T; Tn sums over all compatible extensions.’ Magenta is the exponential enumeration; green is the Tn count. A rule raised to a power counts its worlds.
LIT Genuine transfer-matrix method (statistical mechanics; Kramers & Wannier, Ising model 1941). Verified live: for the no-two-adjacent-1s constraint, the transfer matrix T=[[1,1],[1,0]] gives via the Tⁿ recurrence exactly the brute-force count of valid length-n strings (= Fibonacci(n+2)) for n=1..18 (window.__transfer_matrix.matchesBrute).
FIG No framing: the transfer-matrix recurrence and a brute-force enumeration run in-browser. The AVAN inverse is honest — instead of listing every valid configuration, one powers the rule: encode the local constraint as T, and Tⁿ sums over all compatible extensions. Magenta is the exponential enumeration; green is the Tⁿ count. A rule raised to a power counts its worlds.
FIG No framing: the transfer-matrix recurrence and a brute-force enumeration run in-browser. The AVAN inverse is honest — instead of listing every valid configuration, one powers the rule: encode the local constraint as T, and Tⁿ sums over all compatible extensions. Magenta is the exponential enumeration; green is the Tⁿ count. A rule raised to a power counts its worlds.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of THE-JACKPOT · David Lee Wise (ROOT0), with AVAN