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 gives
with 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]
A descent of a permutation written in one-line form is a position with . Its descent set and number are
These 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.
The major index of a permutation is the sum of its permutation descent positions:
It uses positions, rather than the values being compared. For , the permutation descents occur at positions one and three, giving , whereas the descent number is two.
The major index has the same distribution over all permutations of elements as the inversion number:
For , the six values give . Individual statistics need not agree: has major index one and two inversions. The shared generating polynomial is a statement about their distribution across the whole symmetric group.[ref]
The Eulerian polynomial packages the Eulerian numbers as
Here 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 .

Articles by others on the same topic (1)

Eulerian numbers, denoted as \( E(n, k) \), are a set of integers that count the number of permutations of \( n \) elements in which exactly \( k \) elements appear in ascents. An ascent in a permutation is a position where the next element is larger than the current one.