Identifier
Values
[2,2,2] => [1,1,1,1,0,0,0,0] => [1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,0] => 2
[3,2,2] => [1,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => 2
[2,2,2,1] => [1,1,1,1,0,0,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,1,1,0,0,0,0] => 2
[4,2,2] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => 2
[3,3,2] => [1,1,1,0,1,1,0,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => 2
[3,2,2,1] => [1,0,1,1,1,1,0,0,0,1,0,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => 2
[2,2,2,2] => [1,1,1,1,0,1,0,0,0,0] => [1,0,1,1,0,1,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => 2
[2,2,2,1,1] => [1,1,1,1,0,0,0,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => 2
[4,3,2] => [1,0,1,1,1,0,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => 2
[3,3,3] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,0] => 3
[3,3,2,1] => [1,1,1,0,1,1,0,0,0,1,0,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => 2
[3,2,2,2] => [1,0,1,1,1,1,0,1,0,0,0,0] => [1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => 2
[2,2,2,2,1] => [1,1,1,1,0,1,0,0,0,1,0,0] => [1,0,1,1,0,1,0,0,1,0,1,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => 2
[4,4,2] => [1,1,1,0,1,0,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => 2
[4,3,3] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => 3
[3,3,3,1] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => 3
[3,3,2,2] => [1,1,1,0,1,1,0,1,0,0,0,0] => [1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => 2
[2,2,2,2,2] => [1,1,1,1,0,1,0,1,0,0,0,0] => [1,0,1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => 2
[4,4,3] => [1,1,1,0,1,1,1,0,0,0,0,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => 3
[3,3,3,2] => [1,1,1,1,1,0,0,1,0,0,0,0] => [1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => 2
[4,4,4] => [1,1,1,1,1,0,1,0,0,0,0,0] => [1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => 3
[3,3,3,3] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => 3
search for individual values
searching the database for the individual values of this statistic
Description
The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra 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
peeling map
Description
Send a Dyck path to its peeled Dyck path.
Map
inverse zeta map
Description
The inverse zeta map on Dyck paths.
See its inverse, the zeta map Mp00030zeta map, for the definition and details.