Identifier
Values
[1,0] => [1,1,0,0] => [1,0,1,0] => [3,1,2] => 1
[1,0,1,0] => [1,1,0,1,0,0] => [1,0,1,1,0,0] => [3,1,4,2] => 1
[1,1,0,0] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => [4,1,2,3] => 1
[1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,0] => [3,1,5,2,4] => 1
[1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [1,0,1,1,0,1,0,0] => [5,1,4,2,3] => 1
[1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,0,1,1,1,0,0,0] => [3,1,4,5,2] => 1
[1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [1,0,1,0,1,1,0,0] => [4,1,2,5,3] => 1
[1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => [5,1,2,3,4] => 1
[1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [3,1,5,2,6,4] => 1
[1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [1,0,1,1,0,1,1,0,0,0] => [5,1,4,2,6,3] => 1
[1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0] => [3,1,6,2,4,5] => 1
[1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,0,1,0,0,1,0] => [6,1,4,2,3,5] => 1
[1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,0,1,0,1,0,0] => [6,1,5,2,3,4] => 2
[1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,1,0,0,1,0,0] => [3,1,6,5,2,4] => 1
[1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [3,1,4,5,6,2] => 1
[1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => [3,1,4,6,2,5] => 1
[1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => [4,1,2,6,3,5] => 1
[1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,0,1,0,1,1,0,1,0,0] => [6,1,2,5,3,4] => 1
[1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,0,1,1,1,0,1,0,0,0] => [6,1,4,5,2,3] => 1
[1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [4,1,2,5,6,3] => 1
[1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0] => [5,1,2,3,6,4] => 1
[1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => [6,1,2,3,4,5] => 1
[1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [5,1,2,3,7,4,6] => 1
[1,1,1,1,0,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [5,1,2,3,6,7,4] => 1
[1,1,1,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => [6,1,2,3,4,7,5] => 1
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => [7,1,2,3,4,5,6] => 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] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [3,1,5,2,7,4,8,6] => 1
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,1,0,1,0,1,0,0,0] => [1,0,1,1,0,1,1,0,0,1,0,0,1,0] => [8,1,4,2,6,3,5,7] => 1
[1,0,1,1,1,1,0,1,0,0,0,0] => [1,1,0,1,1,1,1,0,1,0,0,0,0,0] => [1,0,1,1,0,1,0,1,0,1,0,0,1,0] => [6,1,8,2,3,4,5,7] => 2
[1,1,1,1,1,0,0,0,0,1,0,0] => [1,1,1,1,1,1,0,0,0,0,1,0,0,0] => [1,0,1,0,1,1,1,0,1,0,1,0,0,0] => [8,1,2,7,6,3,4,5] => 2
[1,1,1,1,1,0,1,0,0,0,0,0] => [1,1,1,1,1,1,0,1,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [7,1,2,3,4,5,8,6] => 1
[1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [8,1,2,3,4,5,6,7] => 1
[1,1,1,1,1,1,0,1,0,0,0,0,0,0] => [1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [8,1,2,3,4,5,6,9,7] => 1
[1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [9,1,2,3,4,5,6,7,8] => 1
[1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [9,1,2,3,4,5,6,7,10,8] => 1
[1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [10,1,2,3,4,5,6,7,8,9] => 1
[] => [1,0] => [1,0] => [2,1] => 1
[1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [11,1,2,3,4,5,6,7,8,9,10] => 1
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
Description
The number of cycles in the cycle decomposition of a permutation.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
Map
Elizalde-Deutsch bijection
Description
The Elizalde-Deutsch bijection on Dyck paths.
.Let $n$ be the length of the Dyck path. Consider the steps $1,n,2,n-1,\dots$ of $D$. When considering the $i$-th step its corresponding matching step has not yet been read, let the $i$-th step of the image of $D$ be an up step, otherwise let it be a down step.
Map
Ringel
Description
The Ringel permutation of the LNakayama algebra corresponding to a Dyck path.