Identifier
-
Mp00222:
Dyck paths
—peaks-to-valleys⟶
Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000779: Permutations ⟶ ℤ
Values
[1,0,1,0] => [1,1,0,0] => [2,1] => 0
[1,1,0,0] => [1,0,1,0] => [1,2] => 0
[1,0,1,0,1,0] => [1,1,1,0,0,0] => [3,1,2] => 0
[1,0,1,1,0,0] => [1,1,0,0,1,0] => [2,1,3] => 0
[1,1,0,0,1,0] => [1,0,1,1,0,0] => [1,3,2] => 0
[1,1,0,1,0,0] => [1,0,1,0,1,0] => [1,2,3] => 0
[1,1,1,0,0,0] => [1,1,0,1,0,0] => [2,3,1] => 1
[1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => [4,1,2,3] => 0
[1,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => [3,1,2,4] => 0
[1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => 0
[1,0,1,1,0,1,0,0] => [1,1,0,0,1,0,1,0] => [2,1,3,4] => 0
[1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => [3,1,4,2] => 1
[1,1,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0] => [1,4,2,3] => 0
[1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => [1,3,2,4] => 0
[1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => 0
[1,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0] => [1,2,3,4] => 0
[1,1,0,1,1,0,0,0] => [1,0,1,1,0,1,0,0] => [1,3,4,2] => 1
[1,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,0] => [2,4,1,3] => 1
[1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,0] => [2,3,1,4] => 1
[1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,0,0] => [2,3,4,1] => 1
[1,1,1,1,0,0,0,0] => [1,1,1,0,1,0,0,0] => [3,4,1,2] => 1
[1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => [5,1,2,3,4] => 0
[1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => [4,1,2,3,5] => 0
[1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => [3,1,2,5,4] => 0
[1,0,1,0,1,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0] => [3,1,2,4,5] => 0
[1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => [4,1,2,5,3] => 1
[1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,3,4] => 0
[1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => 0
[1,0,1,1,0,1,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => 0
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => 0
[1,0,1,1,0,1,1,0,0,0] => [1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => 1
[1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0] => [3,1,5,2,4] => 1
[1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => [3,1,4,2,5] => 1
[1,0,1,1,1,0,1,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => [3,1,4,5,2] => 1
[1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => [4,1,5,2,3] => 1
[1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => [1,5,2,3,4] => 0
[1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => [1,4,2,3,5] => 0
[1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => 0
[1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => 0
[1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,1,0,0] => [1,4,2,5,3] => 1
[1,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,1,1,0,0,0] => [1,2,5,3,4] => 0
[1,1,0,1,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => 0
[1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => 0
[1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => 0
[1,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,1,0,1,0,0] => [1,2,4,5,3] => 1
[1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,0,1,1,0,0,0] => [1,3,5,2,4] => 1
[1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,1,0,0,1,0] => [1,3,4,2,5] => 1
[1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,0,1,0,1,0,0] => [1,3,4,5,2] => 1
[1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => [1,4,5,2,3] => 1
[1,1,1,0,0,0,1,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => [2,5,1,3,4] => 1
[1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => [2,4,1,3,5] => 1
[1,1,1,0,0,1,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => 1
[1,1,1,0,0,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => [2,3,1,4,5] => 1
[1,1,1,0,0,1,1,0,0,0] => [1,1,0,1,1,0,0,1,0,0] => [2,4,1,5,3] => 2
[1,1,1,0,1,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,0] => [2,3,5,1,4] => 1
[1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => [2,3,4,1,5] => 1
[1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => [2,3,4,5,1] => 1
[1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,1,0,1,0,0,0] => [2,4,5,1,3] => 2
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,0] => [3,5,1,2,4] => 1
[1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => [3,4,1,2,5] => 1
[1,1,1,1,0,0,1,0,0,0] => [1,1,1,0,1,0,0,1,0,0] => [3,4,1,5,2] => 1
[1,1,1,1,0,1,0,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => [3,4,5,1,2] => 1
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [4,5,1,2,3] => 1
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [6,1,2,3,4,5] => 0
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => [5,1,2,3,4,6] => 0
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => [4,1,2,3,6,5] => 0
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,1,1,0,0,0,0,1,0,1,0] => [4,1,2,3,5,6] => 0
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [5,1,2,3,6,4] => 1
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => [3,1,2,6,4,5] => 0
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => [3,1,2,5,4,6] => 0
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,1,0,0,0,1,0,1,1,0,0] => [3,1,2,4,6,5] => 0
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0,1,0] => [3,1,2,4,5,6] => 0
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,1,1,0,0,0,1,1,0,1,0,0] => [3,1,2,5,6,4] => 1
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => [4,1,2,6,3,5] => 1
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,0,1,0,0,1,0] => [4,1,2,5,3,6] => 1
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [4,1,2,5,6,3] => 1
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => [5,1,2,6,3,4] => 1
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => [2,1,6,3,4,5] => 0
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => [2,1,5,3,4,6] => 0
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => [2,1,4,3,6,5] => 0
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => [2,1,4,3,5,6] => 0
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,1,0,0] => [2,1,5,3,6,4] => 1
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,1,1,0,0,0] => [2,1,3,6,4,5] => 0
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => [2,1,3,5,4,6] => 0
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,1,0,0,1,0,1,0,1,1,0,0] => [2,1,3,4,6,5] => 0
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => [2,1,3,4,5,6] => 0
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,0,0,1,0,1,1,0,1,0,0] => [2,1,3,5,6,4] => 1
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,1,0,0,1,1,0,1,1,0,0,0] => [2,1,4,6,3,5] => 1
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,1,0,0,1,0] => [2,1,4,5,3,6] => 1
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,0,0,1,1,0,1,0,1,0,0] => [2,1,4,5,6,3] => 1
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,0,0,1,1,1,0,1,0,0,0] => [2,1,5,6,3,4] => 1
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => [3,1,6,2,4,5] => 1
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0,1,0] => [3,1,5,2,4,6] => 1
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,1,0,0,1,0,0,1,1,0,0] => [3,1,4,2,6,5] => 1
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0,1,0] => [3,1,4,2,5,6] => 1
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => [3,1,5,2,6,4] => 2
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => [3,1,4,6,2,5] => 1
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,0,1,0,1,0,0,1,0] => [3,1,4,5,2,6] => 1
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [3,1,4,5,6,2] => 1
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,0,1,1,0,1,0,0,0] => [3,1,5,6,2,4] => 2
[1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => [4,1,6,2,3,5] => 1
>>> Load all 305 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 tier of a permutation.
This is the number of elements $i$ such that $[i+1,k,i]$ is an occurrence of the pattern $[2,3,1]$. For example, $[3,5,6,1,2,4]$ has tier $2$, with witnesses $[3,5,2]$ (or $[3,6,2]$) and $[5,6,4]$.
According to [1], this is the number of passes minus one needed to sort the permutation using a single stack. The generating function for this statistic appears as OEIS:A122890 and OEIS:A158830 in the form of triangles read by rows, see [sec. 4, 1].
This is the number of elements $i$ such that $[i+1,k,i]$ is an occurrence of the pattern $[2,3,1]$. For example, $[3,5,6,1,2,4]$ has tier $2$, with witnesses $[3,5,2]$ (or $[3,6,2]$) and $[5,6,4]$.
According to [1], this is the number of passes minus one needed to sort the permutation using a single stack. The generating function for this statistic appears as OEIS:A122890 and OEIS:A158830 in the form of triangles read by rows, see [sec. 4, 1].
Map
peaks-to-valleys
Description
Return the path that has a valley wherever the original path has a peak of height at least one.
More precisely, the height of a valley in the image is the height of the corresponding peak minus $2$.
This is also (the inverse of) rowmotion on Dyck paths regarded as order ideals in the triangular poset.
More precisely, the height of a valley in the image is the height of the corresponding peak minus $2$.
This is also (the inverse of) rowmotion on Dyck paths regarded as order ideals in the triangular poset.
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!