Identifier
-
Mp00099:
Dyck paths
—bounce path⟶
Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St001687: Permutations ⟶ ℤ
Values
[1,0] => [1,0] => [1,0] => [2,1] => 0
[1,0,1,0] => [1,0,1,0] => [1,1,0,0] => [2,3,1] => 0
[1,1,0,0] => [1,1,0,0] => [1,0,1,0] => [3,1,2] => 0
[1,0,1,0,1,0] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => [2,3,4,1] => 0
[1,0,1,1,0,0] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => [2,4,1,3] => 1
[1,1,0,0,1,0] => [1,1,0,0,1,0] => [1,0,1,1,0,0] => [3,1,4,2] => 1
[1,1,0,1,0,0] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => [2,4,1,3] => 1
[1,1,1,0,0,0] => [1,1,1,0,0,0] => [1,1,0,1,0,0] => [4,3,1,2] => 0
[1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => [2,3,4,5,1] => 0
[1,0,1,0,1,1,0,0] => [1,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => [2,3,5,1,4] => 2
[1,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => [2,4,1,5,3] => 2
[1,0,1,1,0,1,0,0] => [1,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => [2,3,5,1,4] => 2
[1,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => [2,5,4,1,3] => 1
[1,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0] => [3,1,4,5,2] => 1
[1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => [3,1,5,2,4] => 1
[1,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => [2,4,1,5,3] => 2
[1,1,0,1,0,1,0,0] => [1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => [3,1,5,2,4] => 1
[1,1,0,1,1,0,0,0] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => [2,5,4,1,3] => 1
[1,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,0] => [4,3,1,5,2] => 2
[1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => [3,1,5,2,4] => 1
[1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => [2,5,4,1,3] => 1
[1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0] => [1,1,1,0,1,0,0,0] => [5,3,4,1,2] => 0
[1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => [2,3,4,5,6,1] => 0
[1,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => [2,3,4,6,1,5] => 3
[1,0,1,0,1,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => [2,3,5,1,6,4] => 3
[1,0,1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => [2,3,4,6,1,5] => 3
[1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => [2,3,6,5,1,4] => 2
[1,0,1,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => [2,4,1,5,6,3] => 2
[1,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [2,4,1,6,3,5] => 2
[1,0,1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => [2,3,5,1,6,4] => 3
[1,0,1,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [2,4,1,6,3,5] => 2
[1,0,1,1,0,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => [2,3,6,5,1,4] => 2
[1,0,1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0] => [2,5,4,1,6,3] => 3
[1,0,1,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [2,4,1,6,3,5] => 2
[1,0,1,1,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => [2,3,6,5,1,4] => 2
[1,0,1,1,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => [2,6,4,5,1,3] => 1
[1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => [3,1,4,5,6,2] => 1
[1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => [3,1,4,6,2,5] => 2
[1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => [3,1,5,2,6,4] => 2
[1,1,0,0,1,1,0,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => [3,1,4,6,2,5] => 2
[1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,1,0,0] => [3,1,6,5,2,4] => 1
[1,1,0,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => [2,4,1,5,6,3] => 2
[1,1,0,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [2,4,1,6,3,5] => 2
[1,1,0,1,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => [3,1,5,2,6,4] => 2
[1,1,0,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [2,4,1,6,3,5] => 2
[1,1,0,1,0,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,1,0,0] => [3,1,6,5,2,4] => 1
[1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0] => [2,5,4,1,6,3] => 3
[1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [2,4,1,6,3,5] => 2
[1,1,0,1,1,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,1,0,0] => [3,1,6,5,2,4] => 1
[1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => [2,6,4,5,1,3] => 1
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => [4,3,1,5,6,2] => 2
[1,1,1,0,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => [4,3,1,6,2,5] => 2
[1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => [3,1,5,2,6,4] => 2
[1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => [4,3,1,6,2,5] => 2
[1,1,1,0,0,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,1,0,0] => [3,1,6,5,2,4] => 1
[1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0] => [2,5,4,1,6,3] => 3
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => [4,3,1,6,2,5] => 2
[1,1,1,0,1,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,1,0,0] => [3,1,6,5,2,4] => 1
[1,1,1,0,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => [2,6,4,5,1,3] => 1
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,0,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,0] => [5,3,4,1,6,2] => 3
[1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => [4,3,1,6,2,5] => 2
[1,1,1,1,0,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,1,0,0] => [3,1,6,5,2,4] => 1
[1,1,1,1,0,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => [2,6,4,5,1,3] => 1
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [6,3,4,5,1,2] => 0
[] => [] => [] => [1] => 0
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 distinct positions of the pattern letter 2 in occurrences of 213 in a permutation.
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
bounce path
Description
Sends a Dyck path $D$ of length $2n$ to its bounce path.
This path is formed by starting at the endpoint $(n,n)$ of $D$ and travelling west until encountering the first vertical step of $D$, then south until hitting the diagonal, then west again to hit $D$, etc. until the point $(0,0)$ is reached.
This map is the first part of the zeta map Mp00030zeta map.
This path is formed by starting at the endpoint $(n,n)$ of $D$ and travelling west until encountering the first vertical step of $D$, then south until hitting the diagonal, then west again to hit $D$, etc. until the point $(0,0)$ is reached.
This map is the first part of the zeta map Mp00030zeta map.
Map
Ringel
Description
The Ringel permutation of the LNakayama algebra corresponding to a Dyck path.
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!