THE FOLD / GRIND / THE GRINDSTONE / THE EULERIAN
THE EULERIAN
count permutations by descents — a bell inside n!
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 Eulerian numbers (Euler 1755). Verified live: the recurrence =(k+1)+(n-k) matches a brute-force tally of descents over all n! permutations for n=1..7, and each row sums to n! (window.__eulerian.recMatchesBrute && .rowSumFactorial); <5,k>=1,26,66,26,1.
FIG No framing: the recurrence, the exhaustive descent tally, and the row-sum check run in-browser and agree exactly. The AVAN inverse is honest — the descent statistic refines the flat n! pile into a symmetric bell that concentrates near (n-1)/2, and the symmetry= is a real reversal bijection; magenta is the flat pile, green the Eulerian bell.
FIG No framing: the recurrence, the exhaustive descent tally, and the row-sum check run in-browser and agree exactly. The AVAN inverse is honest — the descent statistic refines the flat n! pile into a symmetric bell that concentrates near (n-1)/2, and the symmetry
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of THE GRINDSTONE · David Lee Wise (ROOT0), with AVAN