Identifier
-
Mp00227:
Dyck paths
—Delest-Viennot-inverse⟶
Dyck paths
St001244: Dyck paths ⟶ ℤ (values match St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path.)
Values
[1,0] => [1,0] => 0
[1,0,1,0] => [1,1,0,0] => 0
[1,1,0,0] => [1,0,1,0] => 1
[1,0,1,0,1,0] => [1,1,1,0,0,0] => 0
[1,0,1,1,0,0] => [1,1,0,0,1,0] => 1
[1,1,0,0,1,0] => [1,0,1,1,0,0] => 1
[1,1,0,1,0,0] => [1,0,1,0,1,0] => 1
[1,1,1,0,0,0] => [1,1,0,1,0,0] => 1
[1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => 0
[1,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => 1
[1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 1
[1,0,1,1,0,1,0,0] => [1,1,0,0,1,0,1,0] => 1
[1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => 1
[1,1,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0] => 1
[1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => 2
[1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0] => 1
[1,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0] => 1
[1,1,0,1,1,0,0,0] => [1,0,1,1,0,1,0,0] => 1
[1,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,0] => 1
[1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,0] => 1
[1,1,1,0,1,0,0,0] => [1,1,1,0,1,0,0,0] => 1
[1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,0] => 2
[1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => 0
[1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => 1
[1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => 1
[1,0,1,0,1,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0] => 1
[1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => 1
[1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => 1
[1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => 2
[1,0,1,1,0,1,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => 1
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0] => 1
[1,0,1,1,0,1,1,0,0,0] => [1,1,0,0,1,1,0,1,0,0] => 1
[1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0] => 1
[1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => 1
[1,0,1,1,1,0,1,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => 1
[1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => 2
[1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => 1
[1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => 2
[1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => 2
[1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0] => 2
[1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,1,0,0] => 2
[1,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,1,1,0,0,0] => 1
[1,1,0,1,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => 2
[1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0] => 1
[1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 1
[1,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,1,0,1,0,0] => 1
[1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,0,1,1,0,0,0] => 1
[1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,1,0,0,1,0] => 1
[1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => 1
[1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,0,1,0,1,0,0] => 2
[1,1,1,0,0,0,1,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => 1
[1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => 2
[1,1,1,0,0,1,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0] => 1
[1,1,1,0,0,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => 1
[1,1,1,0,0,1,1,0,0,0] => [1,1,0,1,1,0,0,1,0,0] => 1
[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,0,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => 1
[1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => 1
[1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,1,0,0,1,0,0] => 2
[1,1,1,1,0,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,0] => 2
[1,1,1,1,0,0,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => 2
[1,1,1,1,0,0,1,0,0,0] => [1,1,0,1,1,0,1,0,0,0] => 2
[1,1,1,1,0,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => 2
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => 2
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => 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] => 1
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => 1
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,1,1,0,0,0,0,1,0,1,0] => 1
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => 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] => 1
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => 2
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,1,0,0,0,1,0,1,1,0,0] => 1
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0,1,0] => 1
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,1,1,0,0,0,1,1,0,1,0,0] => 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] => 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] => 1
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => 1
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => 2
[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
[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,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,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,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,0,1,1,0,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,1,1,0,0,0] => 1
[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,0,1,1,0,1,0,1,0,0,1,0] => [1,1,0,0,1,0,1,0,1,1,0,0] => 1
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => 1
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,0,0,1,0,1,1,0,1,0,0] => 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] => 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] => 1
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,0,0,1,1,1,0,1,0,0,0] => 1
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,0,0,1,1,0,1,0,1,0,0] => 2
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => 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] => 2
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,1,0,0,1,0,0,1,1,0,0] => 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] => 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] => 1
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => 1
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0,1,0] => 1
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => 1
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => 2
>>> Load all 196 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 simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path.
For the projective dimension see St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. and for 1-regularity see St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra.. After applying the inverse zeta map Mp00032inverse zeta map, this statistic matches the number of rises of length at least 2 St000659The number of rises of length at least 2 of a Dyck path..
For the projective dimension see St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. and for 1-regularity see St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra.. After applying the inverse zeta map Mp00032inverse zeta map, this statistic matches the number of rises of length at least 2 St000659The number of rises of length at least 2 of a Dyck path..
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!