Descent
Given a permutation of
,
is said to have a descent at position
if and only if
. For example, the permutation
has descents at positions 2 (since
) and 4 (since
).
The set of descents of a permutation is called its descent set. If is a permutation of
then its descent set is some subset of
.
This article is a stub. Help us out by expanding it.