descent of a permutation

Tags: #definition

descent of a permutation

Let wSn be a permutation and write it w=w1,w2,,wn. A descent is an index i such that wi>wi+1.
In other words, wiwi+1 goes down (descent).

Examples

Properties

See Eulerian numbers