Identifier
-
Mp00227:
Dyck paths
—Delest-Viennot-inverse⟶
Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001182: Dyck paths ⟶ ℤ
Values
[1,0] => [1,0] => [1,1,0,0] => [1,0,1,0] => 3
[1,0,1,0] => [1,1,0,0] => [1,1,1,0,0,0] => [1,1,0,1,0,0] => 3
[1,1,0,0] => [1,0,1,0] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => 4
[1,0,1,0,1,0] => [1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,1,1,0,1,0,0,0] => 3
[1,0,1,1,0,0] => [1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,0] => 4
[1,1,0,0,1,0] => [1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [1,0,1,1,0,1,0,0] => 4
[1,1,0,1,0,0] => [1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0] => 5
[1,1,1,0,0,0] => [1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,0,0] => 5
[1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => 3
[1,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => 4
[1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [1,1,0,1,1,0,0,1,0,0] => 4
[1,0,1,1,0,1,0,0] => [1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => 5
[1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,1,1,0,1,0,0,1,0,0] => 5
[1,1,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => 4
[1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,1,0,0,1,0] => 5
[1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,1,0,1,0,0] => 5
[1,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 6
[1,1,0,1,1,0,0,0] => [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,1,0,0] => 6
[1,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,1,0,1,0,0,0] => 5
[1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => 6
[1,1,1,0,1,0,0,0] => [1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => 5
[1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => 6
[1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => 3
[1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,1,1,1,0,1,0,0,0,0,1,0] => 4
[1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => 4
[1,0,1,0,1,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0,1,0] => 5
[1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => 5
[1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => 4
[1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,0,1,0] => 5
[1,0,1,1,0,1,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => [1,1,0,1,0,0,1,1,0,1,0,0] => 5
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0,1,0] => 6
[1,0,1,1,0,1,1,0,0,0] => [1,1,0,0,1,1,0,1,0,0] => [1,1,1,0,0,1,1,0,1,0,0,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => 6
[1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => 5
[1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => [1,1,1,0,1,0,0,1,0,0,1,0] => 6
[1,0,1,1,1,0,1,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => 5
[1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => 6
[1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => [1,0,1,1,1,1,0,1,0,0,0,0] => 4
[1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [1,0,1,1,1,0,1,0,0,0,1,0] => 5
[1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => [1,0,1,1,0,1,1,0,0,1,0,0] => 5
[1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [1,0,1,1,0,1,0,0,1,0,1,0] => 6
[1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => [1,0,1,1,1,0,1,0,0,1,0,0] => 6
[1,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [1,0,1,0,1,1,1,0,1,0,0,0] => 5
[1,1,0,1,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => [1,0,1,0,1,1,0,1,0,0,1,0] => 6
[1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,0,1,1,0,1,0,0] => 6
[1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 7
[1,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [1,0,1,0,1,1,0,1,0,1,0,0] => 7
[1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => [1,0,1,1,0,1,1,0,1,0,0,0] => 6
[1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => [1,0,1,1,0,1,0,1,0,0,1,0] => 7
[1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => [1,0,1,1,1,0,1,0,1,0,0,0] => 6
[1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => [1,0,1,1,0,1,0,1,0,1,0,0] => 7
[1,1,1,0,0,0,1,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => 5
[1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0,1,0] => 6
[1,1,1,0,0,1,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => 6
[1,1,1,0,0,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0,1,0] => 7
[1,1,1,0,0,1,1,0,0,0] => [1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => 7
[1,1,1,0,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => 5
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0,1,0] => 6
[1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => 5
[1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => 6
[1,1,1,1,0,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => 6
[1,1,1,1,0,0,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => [1,1,0,1,0,1,0,1,0,0,1,0] => 7
[1,1,1,1,0,0,1,0,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => 6
[1,1,1,1,0,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 7
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => 7
[] => [] => [1,0] => [1,0] => 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
Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra.
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
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
Map
Delest-Viennot-inverse
Description
Return the Dyck path obtained by applying the inverse of Delest-Viennot's bijection to the corresponding parallelogram polyomino.
Let $D$ be a Dyck path of semilength $n$. The parallelogram polyomino $\gamma(D)$ is defined as follows: let $\tilde D = d_0 d_1 \dots d_{2n+1}$ be the Dyck path obtained by prepending an up step and appending a down step to $D$. Then, the upper path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with even indices, and the lower path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with odd indices.
The Delest-Viennot bijection $\beta$ returns the parallelogram polyomino, whose column heights are the heights of the peaks of the Dyck path, and the intersection heights between columns are the heights of the valleys of the Dyck path.
This map returns the Dyck path $(\beta^{(-1)}\circ\gamma)(D)$.
Let $D$ be a Dyck path of semilength $n$. The parallelogram polyomino $\gamma(D)$ is defined as follows: let $\tilde D = d_0 d_1 \dots d_{2n+1}$ be the Dyck path obtained by prepending an up step and appending a down step to $D$. Then, the upper path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with even indices, and the lower path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with odd indices.
The Delest-Viennot bijection $\beta$ returns the parallelogram polyomino, whose column heights are the heights of the peaks of the Dyck path, and the intersection heights between columns are the heights of the valleys of the Dyck path.
This map returns the Dyck path $(\beta^{(-1)}\circ\gamma)(D)$.
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!