Identifier
Values
[1,1] => [1,1,0,0] => [2,3,1] => [1,1,0,1,0,0] => 2
[2,1] => [1,0,1,1,0,0] => [3,1,4,2] => [1,1,1,0,0,1,0,0] => 2
[3,1] => [1,0,1,0,1,1,0,0] => [4,1,2,5,3] => [1,1,1,1,0,0,0,1,0,0] => 2
[2,2] => [1,1,1,0,0,0] => [2,3,4,1] => [1,1,0,1,0,1,0,0] => 3
[3,2] => [1,0,1,1,1,0,0,0] => [3,1,4,5,2] => [1,1,1,0,0,1,0,1,0,0] => 3
[2,2,1] => [1,1,1,0,0,1,0,0] => [2,5,4,1,3] => [1,1,0,1,1,1,0,0,0,0] => 2
[2,2,2] => [1,1,1,1,0,0,0,0] => [2,3,4,5,1] => [1,1,0,1,0,1,0,1,0,0] => 4
search for individual values
searching the database for the individual values of this statistic
Description
The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$.
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.
Map
left-to-right-maxima to Dyck path
Description
The left-to-right maxima of a permutation as a Dyck path.
Let $(c_1, \dots, c_k)$ be the rise composition Mp00102rise composition of the path. Then the corresponding left-to-right maxima are $c_1, c_1+c_2, \dots, c_1+\dots+c_k$.
Restricted to 321-avoiding permutations, this is the inverse of Mp00119to 321-avoiding permutation (Krattenthaler), restricted to 312-avoiding permutations, this is the inverse of Mp00031to 312-avoiding permutation.
Map
Ringel
Description
The Ringel permutation of the LNakayama algebra corresponding to a Dyck path.