Descent of a permutation 2026-11-05
A descent of a permutation written in one-line form is a position with . Its descent set and number areThese are adjacent comparisons, unlike inversions of a permutation, which compare arbitrary ordered pairs of positions.
For , the descents occur at positions one and three, since and . The middle comparison is increasing. The identity permutation has no descents, while the reversed order has .
The Eulerian number counts permutations with descents under the stated indexing convention. The major index instead sums their positions; for it is , illustrating a different statistic derived from the same descent set.
Eulerian number Created 2026-10-20 Updated 2026-11-05
With the descent convention, the Eulerian number counts permutations of with exactly positions satisfying . These positions are permutation descents. For , the row is : only
123 has no descent and only 321 has two. Inserting the largest label giveswith and out-of-range entries zero. Of the insertion gaps, preserve descents, while the remaining gaps increase the descent count. Some sources shift the second index by one, so the convention must accompany the symbol.[ref] Eulerian polynomial Created 2026-10-20 Updated 2026-11-05
The Eulerian polynomial packages the Eulerian numbers asHere counts permutation descents. For example, . In particular , because setting every weight to one counts all permutations. The Eulerian number recurrence gives for . Conventions using multiply this polynomial by .