Identifier
-
Mp00199:
Dyck paths
—prime Dyck path⟶
Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000018: Permutations ⟶ ℤ
Values
[1,0] => [1,1,0,0] => [2,1] => 1
[1,0,1,0] => [1,1,0,1,0,0] => [2,3,1] => 2
[1,1,0,0] => [1,1,1,0,0,0] => [3,1,2] => 2
[1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [2,3,4,1] => 3
[1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [2,4,1,3] => 3
[1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [3,1,4,2] => 3
[1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [3,4,1,2] => 4
[1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [4,1,2,3] => 3
[1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [2,3,4,5,1] => 4
[1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [2,3,5,1,4] => 4
[1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [2,4,1,5,3] => 4
[1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [2,4,5,1,3] => 5
[1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [2,5,1,3,4] => 4
[1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [3,1,4,5,2] => 4
[1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [3,1,5,2,4] => 4
[1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [3,4,1,5,2] => 5
[1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [3,4,5,1,2] => 6
[1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [3,5,1,2,4] => 5
[1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [4,1,2,5,3] => 4
[1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [4,1,5,2,3] => 5
[1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [4,5,1,2,3] => 6
[1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [5,1,2,3,4] => 4
[1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [2,3,4,5,6,1] => 5
[1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [2,3,4,6,1,5] => 5
[1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => [2,3,5,1,6,4] => 5
[1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [2,3,5,6,1,4] => 6
[1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [2,3,6,1,4,5] => 5
[1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [2,4,1,5,6,3] => 5
[1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => [2,4,1,6,3,5] => 5
[1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => [2,4,5,1,6,3] => 6
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => [2,4,5,6,1,3] => 7
[1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => [2,4,6,1,3,5] => 6
[1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [2,5,1,3,6,4] => 5
[1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => [2,5,1,6,3,4] => 6
[1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => [2,5,6,1,3,4] => 7
[1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => [2,6,1,3,4,5] => 5
[1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [3,1,4,5,6,2] => 5
[1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => [3,1,4,6,2,5] => 5
[1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => [3,1,5,2,6,4] => 5
[1,1,0,0,1,1,0,1,0,0] => [1,1,1,0,0,1,1,0,1,0,0,0] => [3,1,5,6,2,4] => 6
[1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => [3,1,6,2,4,5] => 5
[1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => [3,4,1,5,6,2] => 6
[1,1,0,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => [3,4,1,6,2,5] => 6
[1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => [3,4,5,1,6,2] => 7
[1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [3,4,5,6,1,2] => 8
[1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => [3,4,6,1,2,5] => 7
[1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => [3,5,1,2,6,4] => 6
[1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => [3,5,1,6,2,4] => 7
[1,1,0,1,1,0,1,0,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => [3,5,6,1,2,4] => 8
[1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => [3,6,1,2,4,5] => 6
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [4,1,2,5,6,3] => 5
[1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => [4,1,2,6,3,5] => 5
[1,1,1,0,0,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => [4,1,5,2,6,3] => 6
[1,1,1,0,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => [4,1,5,6,2,3] => 7
[1,1,1,0,0,1,1,0,0,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => [4,1,6,2,3,5] => 6
[1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => [4,5,1,2,6,3] => 7
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => [4,5,1,6,2,3] => 8
[1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [4,5,6,1,2,3] => 9
[1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => [4,6,1,2,3,5] => 7
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [5,1,2,3,6,4] => 5
[1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => [5,1,2,6,3,4] => 6
[1,1,1,1,0,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => [5,1,6,2,3,4] => 7
[1,1,1,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => [5,6,1,2,3,4] => 8
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [6,1,2,3,4,5] => 5
[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] => [2,3,4,5,6,7,1] => 6
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,1,1,0,0,0] => [2,3,4,5,7,1,6] => 6
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,1,1,0,0,1,0,0] => [2,3,4,6,1,7,5] => 6
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,0,1,1,0,1,0,0,0] => [2,3,4,6,7,1,5] => 7
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,1,1,1,0,0,0,0] => [2,3,4,7,1,5,6] => 6
[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] => [2,3,5,6,7,1,4] => 8
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,1,1,0,1,1,0,0,0,0,0] => [2,5,7,1,3,4,6] => 8
[1,0,1,1,1,1,0,0,1,0,0,0] => [1,1,0,1,1,1,1,0,0,1,0,0,0,0] => [2,6,1,7,3,4,5] => 8
[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] => [2,6,7,1,3,4,5] => 9
[1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,0,1,1,1,1,1,0,0,0,0,0,0] => [2,7,1,3,4,5,6] => 6
[1,1,0,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,1,0,0,0] => [3,4,5,6,7,1,2] => 10
[1,1,1,0,1,1,0,0,0,0,1,0] => [1,1,1,1,0,1,1,0,0,0,0,1,0,0] => [4,6,1,2,3,7,5] => 8
[1,1,1,1,0,0,0,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,1,0,0] => [5,1,2,3,6,7,4] => 6
[1,1,1,1,0,0,0,0,1,1,0,0] => [1,1,1,1,1,0,0,0,0,1,1,0,0,0] => [5,1,2,3,7,4,6] => 6
[1,1,1,1,0,0,1,0,0,0,1,0] => [1,1,1,1,1,0,0,1,0,0,0,1,0,0] => [5,1,6,2,3,7,4] => 8
[1,1,1,1,0,1,0,0,0,0,1,0] => [1,1,1,1,1,0,1,0,0,0,0,1,0,0] => [5,6,1,2,3,7,4] => 9
[1,1,1,1,0,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,1,0,0,0,0,0] => [5,6,7,1,2,3,4] => 12
[1,1,1,1,1,0,0,0,0,0,1,0] => [1,1,1,1,1,1,0,0,0,0,0,1,0,0] => [6,1,2,3,4,7,5] => 6
[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] => [6,1,2,3,7,4,5] => 7
[1,1,1,1,1,0,0,0,1,0,0,0] => [1,1,1,1,1,1,0,0,0,1,0,0,0,0] => [6,1,2,7,3,4,5] => 8
[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] => [6,7,1,2,3,4,5] => 10
[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] => [7,1,2,3,4,5,6] => 6
[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] => [2,3,4,5,6,7,8,1] => 7
[1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,1,0,1,1,0,0,0] => [2,3,4,5,6,8,1,7] => 7
[1,0,1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,0,1,0,1,1,0,1,0,0,0] => [2,3,4,5,7,8,1,6] => 8
[1,0,1,0,1,1,0,1,0,0,1,0,1,0] => [1,1,0,1,0,1,1,0,1,0,0,1,0,1,0,0] => [2,3,5,6,1,7,8,4] => 8
[1,0,1,1,0,1,0,1,0,1,0,0,1,0] => [1,1,0,1,1,0,1,0,1,0,1,0,0,1,0,0] => [2,4,5,6,7,1,8,3] => 10
[1,0,1,1,0,1,1,0,0,1,0,0,1,0] => [1,1,0,1,1,0,1,1,0,0,1,0,0,1,0,0] => [2,4,6,1,7,3,8,5] => 9
[1,0,1,1,0,1,1,0,1,1,0,0,0,0] => [1,1,0,1,1,0,1,1,0,1,1,0,0,0,0,0] => [2,4,6,8,1,3,5,7] => 10
[1,0,1,1,0,1,1,1,0,1,0,0,0,0] => [1,1,0,1,1,0,1,1,1,0,1,0,0,0,0,0] => [2,4,7,8,1,3,5,6] => 11
[1,0,1,1,1,0,0,1,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,1,1,0,0,0,1,0,0] => [2,5,1,7,3,4,8,6] => 8
[1,0,1,1,1,0,1,0,1,1,0,0,0,0] => [1,1,0,1,1,1,0,1,0,1,1,0,0,0,0,0] => [2,5,6,8,1,3,4,7] => 11
[1,0,1,1,1,0,1,1,0,1,0,0,0,0] => [1,1,0,1,1,1,0,1,1,0,1,0,0,0,0,0] => [2,5,7,8,1,3,4,6] => 12
[1,0,1,1,1,1,0,1,0,0,0,0,1,0] => [1,1,0,1,1,1,1,0,1,0,0,0,0,1,0,0] => [2,6,7,1,3,4,8,5] => 10
[1,0,1,1,1,1,0,1,0,1,0,0,0,0] => [1,1,0,1,1,1,1,0,1,0,1,0,0,0,0,0] => [2,6,7,8,1,3,4,5] => 13
[1,0,1,1,1,1,1,0,1,0,0,0,0,0] => [1,1,0,1,1,1,1,1,0,1,0,0,0,0,0,0] => [2,7,8,1,3,4,5,6] => 11
[1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,0,1,1,1,1,1,1,0,0,0,0,0,0,0] => [2,8,1,3,4,5,6,7] => 7
>>> Load all 164 entries. <<<
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 inversions of a permutation.
This equals the minimal number of simple transpositions $(i,i+1)$ needed to write $\pi$. Thus, it is also the Coxeter length of $\pi$.
This equals the minimal number of simple transpositions $(i,i+1)$ needed to write $\pi$. Thus, it is also the Coxeter length of $\pi$.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
Map
to 321-avoiding permutation (Krattenthaler)
Description
Krattenthaler's bijection to 321-avoiding permutations.
Draw the path of semilength $n$ in an $n\times n$ square matrix, starting at the upper left corner, with right and down steps, and staying below the diagonal. Then the permutation matrix is obtained by placing ones into the cells corresponding to the peaks of the path and placing ones into the remaining columns from left to right, such that the row indices of the cells increase.
Draw the path of semilength $n$ in an $n\times n$ square matrix, starting at the upper left corner, with right and down steps, and staying below the diagonal. Then the permutation matrix is obtained by placing ones into the cells corresponding to the peaks of the path and placing ones into the remaining columns from left to right, such that the row indices of the cells increase.
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!