Skip to content

WeakExceedances on Permutation ​

Positions with p(i) >= i.

On Permutation

Called as CombinatorialStat(x, "WeakExceedances"). The head's page has its examples.

Live

FindStat St000213

The number of weak exceedances (also weak excedences) of a permutation.

ObjectValue
[1]1
[1,2]2
[2,1]1
[1,2,3]3
[1,3,2]2
[2,1,3]2
[2,3,1]2
[3,1,2]1

Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000213 has the rest.