Identifier
Values
[1] => [1,0,1,0] => [1,1,0,1,0,0] => [4,3,1,2] => 3
[2] => [1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [2,5,4,1,3] => 3
[1,1] => [1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [4,3,1,5,2] => 2
[3] => [1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [2,3,6,5,1,4] => 3
[2,1] => [1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [5,4,1,2,3] => 3
[1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [4,3,1,5,6,2] => 2
[3,1] => [1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [6,3,5,1,2,4] => 3
[2,2] => [1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [2,5,4,1,6,3] => 2
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [6,4,1,5,2,3] => 3
[3,2] => [1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [2,6,5,1,3,4] => 3
[3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [6,3,1,5,2,4] => 3
[2,2,1] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [5,4,1,2,6,3] => 2
[3,2,1] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [5,6,1,2,3,4] => 2
[4,3,2] => [1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [2,6,7,1,3,4,5] => 2
[3,3,2,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [5,6,1,2,3,7,4] => 2
[4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [7,6,1,2,3,4,5] => 3
[4,4,3,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,0,1,1,0,0,0] => [2,6,7,1,3,4,8,5] => 2
[5,4,3,2,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,1,0,0] => [8,7,1,2,3,4,5,6] => 3
[] => [] => [1,0] => [2,1] => 2
[6,5,4,3,2,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0] => [8,9,1,2,3,4,5,6,7] => 2
[7,6,5,4,3,2,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0] => [10,9,1,2,3,4,5,6,7,8] => 3
search for individual values
searching the database for the individual values of this statistic
/ search for generating function
searching the database for statistics with the same generating function
click to show known generating functions       
Description
The number of saliances of the permutation.
A saliance is a right-to-left maximum. This can be described as an occurrence of the mesh pattern $([1], {(1,1)})$, i.e., the upper right quadrant is shaded, see [1].
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
Map
Ringel
Description
The Ringel permutation of the LNakayama algebra corresponding to a Dyck path.
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.