Alphabeta Math
RemarkRemark: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (gpt-5.6-terra)audited 2026-08-26
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

This page uses the published inversion number and the shifted Eulerian indexing A(n,k)

This page keeps the published inversion convention of Inversions, inversion number, the sign sgn(σ)=(1)inv(σ), and even and odd permutations exactly as written: permutations act on n={0,1,,n1}, and an inversion is a pair (i,j) with i<j<n and σ(i)>σ(j). Nothing here reverses that orientation or silently shifts to a 1,,n indexing set.

The same zero-based convention is used for descents and excedances, but the major index is still the classical sum of descent positions counted from 1. Thus a descent at the zero-based position i contributes i+1 to maj(σ).

The Eulerian number A(n,k) counts permutations of Sn with exactly k descents, so k ranges from 0 to n1 when n1. We also set A(0,0)=1, and the Eulerian polynomial is An(t)=k=0n1A(n,k)tk for n1 with A0(t)=1.

Depends on

Used by

Dependency tree · two levels

7 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources