Identifier
Values
[1] => [1,0] => [1,0] => [1,1,0,0] => 0
[2] => [1,0,1,0] => [1,1,0,0] => [1,1,1,0,0,0] => 0
[1,1] => [1,1,0,0] => [1,0,1,0] => [1,1,0,1,0,0] => 1
[3] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => 0
[2,1] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => 1
[1,1,1] => [1,1,0,1,0,0] => [1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => 0
[4] => [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] => 0
[3,1] => [1,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => 1
[2,2] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => 1
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => 0
[1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => 0
[3,2] => [1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => 1
[2,2,1] => [1,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => 0
[3,3] => [1,1,1,0,1,0,0,0] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => 0
[2,2,2] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => 2
[] => [] => [] => [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 maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid.
The correspondence between LNakayama algebras and Dyck paths is explained in St000684The global dimension of the LNakayama algebra associated to a Dyck path.. A module $M$ is $n$-rigid, if $\operatorname{Ext}^i(M,M)=0$ for $1\leq i\leq n$.
This statistic gives the maximal $n$ such that the minimal generator-cogenerator module $A \oplus D(A)$ of the LNakayama algebra $A$ corresponding to a Dyck path is $n$-rigid.
An application is to check for maximal $n$-orthogonal objects in the module category in the sense of [2].
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
parallelogram polyomino
Description
Return the Dyck path corresponding to the partition interpreted as a parallogram polyomino.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.