Skip to content

BigAscents on Permutation ​

Positions i with p(i+1) - p(i) > 1.

On Permutation

Called as CombinatorialStat(x, "BigAscents"). 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 St000646

The number of big ascents of a permutation.

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

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