AscentTopsWithSmallerValuesBefore on Permutation
Ascents i whose top p(i+1) has every smaller value among p(1), ..., p(i).
Called as CombinatorialStat(x, "AscentTopsWithSmallerValuesBefore"). The head's page has its examples.
Live
Distribution
Over SymmetricGroup at each size, tallied here in your browser; sizes past 8 are not offered.
FindStat St001640
The number of ascent tops in the permutation such that all smaller elements appear before.
| Object | Value |
|---|---|
[1] | 0 |
[1,2] | 1 |
[2,1] | 0 |
[1,2,3] | 2 |
[1,3,2] | 0 |
[2,1,3] | 1 |
[2,3,1] | 0 |
[3,1,2] | 1 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001640 has the rest.