Ascents on Permutation
Positions i with p(i) < p(i+1).
Called as CombinatorialStat(x, "Ascents"). The head's page has its examples.
Live
FindStat St000245
The number of ascents of a permutation.
| Object | Value |
|---|---|
[] | 0 |
[1] | 0 |
[1,2] | 1 |
[2,1] | 0 |
[1,2,3] | 2 |
[1,3,2] | 1 |
[2,1,3] | 1 |
[2,3,1] | 1 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000245 has the rest.