Identifier
Values
[1,0] => [1,1,0,0] => [1,0,1,0] => [1,1,0,0] => 1
[1,0,1,0] => [1,1,0,1,0,0] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 1
[1,1,0,0] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => [1,1,0,1,0,0] => 2
[1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0] => [1,1,0,1,1,0,0,0] => 2
[1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [1,0,1,1,0,1,0,0] => [1,1,0,0,1,0,1,0] => 1
[1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 2
[1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,0,1,0] => 2
[1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => 3
[1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,0,1,0,0,0] => 2
[1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => 2
[1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => 2
[1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,0,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => 2
[1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [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,1,1,0,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => 3
[1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [1,0,1,1,0,1,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => 2
[1,1,0,1,0,0,1,0] => [1,1,1,0,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
[1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,1,0,0,0] => 3
[1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => 2
[1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,0,1,0,0] => 3
[1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0] => 3
[1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => 3
[1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => 4
[] => [1,0] => [1,0] => [1,0] => 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
click to show known generating functions       
Description
The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path.
The statistic returns zero in case that bimodule is the zero module.
Map
decomposition reverse
Description
This map is recursively defined as follows.
The unique empty path of semilength $0$ is sent to itself.
Let $D$ be a Dyck path of semilength $n > 0$ and decompose it into $1 D_1 0 D_2$ with Dyck paths $D_1, D_2$ of respective semilengths $n_1$ and $n_2$ such that $n_1$ is minimal. One then has $n_1+n_2 = n-1$.
Now let $\tilde D_1$ and $\tilde D_2$ be the recursively defined respective images of $D_1$ and $D_2$ under this map. The image of $D$ is then defined as $1 \tilde D_2 0 \tilde D_1$.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
Map
reflect parallelogram polyomino
Description
Reflect the corresponding parallelogram polyomino, such that the first column becomes the first row.
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.