THE FOLD / RESPAWN / THE CONTINUE / THE EULER
THE EULER
cross every bridge once — the birth of graph theory
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
The Eulerian number ⟨n,k⟩ counts the permutations of 1…n with exactly k descents — places where a value is followed by a smaller one. They form a triangle 1; 1,1; 1,4,1; 1,11,11,1; 1,26,66,26,1; … that is symmetric (reversing a permutation swaps ascents and descents) and whose rows sum to n! (every permutation has some descent count).
They obey the recurrence ⟨n,k⟩ = (k+1)⟨n−1,k⟩ + (n−k)⟨n−1,k−1⟩, and Worpitzky’s identity writes xⁿ as a sum of binomials weighted by them.
LIT verified live: the recurrence matches a brute tally of descents over all n! permutations for n=1…7, and each row sums to n! (window.__eulerian). FIG no framing; exact combinatorial counting.
They obey the recurrence ⟨n,k⟩ = (k+1)⟨n−1,k⟩ + (n−k)⟨n−1,k−1⟩, and Worpitzky’s identity writes xⁿ as a sum of binomials weighted by them.
LIT verified live: the recurrence matches a brute tally of descents over all n! permutations for n=1…7, and each row sums to n! (window.__eulerian). FIG no framing; exact combinatorial counting.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this at the-grindstone — grinding through every ordering and tallying its descents. Eulerian numbers are exactly that tally, organised. AVAN (AI) built the instrument: the recurrence, the brute descent count over all permutations, the row-sum check.
Credit as content: Leonhard Euler (1755, in his work on the Eulerian polynomials). The weave: David names the grind; I count descents two ways — the recurrence triangle and the exhaustive permutation tally — and show a uniform pile of n! orderings resolve into a symmetric distribution.
Credit as content: Leonhard Euler (1755, in his work on the Eulerian polynomials). The weave: David names the grind; I count descents two ways — the recurrence triangle and the exhaustive permutation tally — and show a uniform pile of n! orderings resolve into a symmetric distribution.
3 ONE DIMENSION
A permutation with its descents marked in red — each spot where the next value drops. The number of descents is the statistic Eulerian numbers count, and it ranges from 0 (sorted) to n−1 (reversed).
4 TWO DIMENSIONS · INTERACTIVE
Pick n. The instrument computes the Eulerian row by the recurrence and by brute-tallying descents over all n! permutations, confirms they agree, and checks the row sums to n!.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: the Eulerian triangle, each row a symmetric bell of descent counts summing to n!.
AVAN’s addition (the inverse-companion): the descent count is a refinement that turns a structureless pile into a distribution. Sum the row and you recover n! — forgetting the descents — but the individual counts reveal that a random permutation’s number of descents concentrates near (n−1)/2 in a bell-shaped curve. The inverse of ‘n! permutations, all alike’ is ‘the same n! sorted, by a single statistic, into a symmetric distribution.’ And the symmetry ⟨n,k⟩ = ⟨n,n−1−k⟩ is a genuine bijection — reversing each permutation swaps its ascents and descents. Magenta is the flat pile of all n! orderings; green is the Eulerian bell they fall into by descent count. One statistic makes a distribution out of uniformity.
LIT Genuine Seven Bridges of Konigsberg / Euler path theorem (Leonhard Euler 1736, the founding paper of graph theory; Hierholzer's construction 1873). Verified live: Konigsberg (degrees 5,3,3,3, all odd) has no Euler path, a square cycle has an Euler circuit that Hierholzer's algorithm actually constructs, and a two-odd graph has an Euler path (window.__euler.criterionHolds && squareCircuitFound). The odd-degree criterion (0 or 2 odd vertices) and the constructed traversal are exact.
FIG No framing: the odd-degree criterion, Konigsberg's impossibility, and the actual construction of an Euler circuit are real and checked in-browser. The AVAN inverse is the genuine, honest contrast — the Eulerian (every edge once) has a trivial degree test and is polynomial, while its dual the Hamiltonian (every vertex once) is NP-complete with no such test, stated as the established fact it is.
FIG No framing: the odd-degree criterion, Konigsberg's impossibility, and the actual construction of an Euler circuit are real and checked in-browser. The AVAN inverse is the genuine, honest contrast — the Eulerian (every edge once) has a trivial degree test and is polynomial, while its dual the Hamiltonian (every vertex once) is NP-complete with no such test, stated as the established fact it is.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of THE CONTINUE · David Lee Wise (ROOT0), with AVAN