Identifier
-
Mp00230:
Integer partitions
—parallelogram polyomino⟶
Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St000689: Dyck paths ⟶ ℤ
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
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 Exti(M,M)=0 for 1≤i≤n.
This statistic gives the maximal n such that the minimal generator-cogenerator module A⊕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].
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 Exti(M,M)=0 for 1≤i≤n.
This statistic gives the maximal n such that the minimal generator-cogenerator module A⊕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
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.
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.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
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 1D10D2 with Dyck paths D1,D2 of respective semilengths n1 and n2 such that n1 is minimal. One then has n1+n2=n−1.
Now let ˜D1 and ˜D2 be the recursively defined respective images of D1 and D2 under this map. The image of D is then defined as 1˜D20˜D1.
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 1D10D2 with Dyck paths D1,D2 of respective semilengths n1 and n2 such that n1 is minimal. One then has n1+n2=n−1.
Now let ˜D1 and ˜D2 be the recursively defined respective images of D1 and D2 under this map. The image of D is then defined as 1˜D20˜D1.
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!