NonInitialLeftToRightMinima on Permutation
Positions i >= 2 with p(i) smaller than everything before it.
FindStat's title speaks of indices with all smaller indices to the right; its code counts these, one less than LeftToRightMinima.
Called as CombinatorialStat(x, "NonInitialLeftToRightMinima"). 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 St000541
The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right.
| Object | Value |
|---|---|
[1,2] | 0 |
[2,1] | 1 |
[1,2,3] | 0 |
[1,3,2] | 0 |
[2,1,3] | 1 |
[2,3,1] | 1 |
[3,1,2] | 1 |
[3,2,1] | 2 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000541 has the rest.