Identifier
Values
[1] => [1] => [1,0] => [1,0] => 0
[1,1] => [1,1] => [1,1,0,0] => [1,0,1,0] => 1
[2] => [2] => [1,0,1,0] => [1,1,0,0] => 0
[1,2] => [2,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 1
[2,1] => [2,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 1
[3] => [3] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => 0
[1,3] => [3,1] => [1,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => 1
[2,2] => [2,2] => [1,1,1,0,0,0] => [1,1,0,1,0,0] => 2
[3,1] => [3,1] => [1,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => 1
[4] => [4] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => 0
[1,4] => [4,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => 1
[2,3] => [3,2] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => 2
[3,2] => [3,2] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => 2
[4,1] => [4,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => 1
[5] => [5] => [1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => 0
[1,5] => [5,1] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => 1
[2,2,2] => [2,2,2] => [1,1,1,1,0,0,0,0] => [1,1,1,0,1,0,0,0] => 3
[2,4] => [4,2] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => 2
[4,2] => [4,2] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => 2
[5,1] => [5,1] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => 1
[6] => [6] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => 0
[1,6] => [6,1] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => 1
[2,2,3] => [3,2,2] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => 3
[2,3,2] => [3,2,2] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => 3
[2,5] => [5,2] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => 2
[3,2,2] => [3,2,2] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => 3
[5,2] => [5,2] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => 2
[6,1] => [6,1] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => 1
[7] => [7] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => 0
[2,2,4] => [4,2,2] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => 3
[2,4,2] => [4,2,2] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => 3
[2,6] => [6,2] => [1,0,1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,1,0,0] => 2
[4,2,2] => [4,2,2] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => 3
[6,2] => [6,2] => [1,0,1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,1,0,0] => 2
[2,2,5] => [5,2,2] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,1,0,0,0] => 3
[2,5,2] => [5,2,2] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,1,0,0,0] => 3
[3,3,3] => [3,3,3] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => 4
[5,2,2] => [5,2,2] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,1,0,0,0] => 3
[3,3,4] => [4,3,3] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => 4
[3,4,3] => [4,3,3] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => 4
[4,3,3] => [4,3,3] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => 4
[3,3,3,3] => [3,3,3,3] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => 5
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 number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 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.
Map
peaks-to-valleys
Description
Return the path that has a valley wherever the original path has a peak of height at least one.
More precisely, the height of a valley in the image is the height of the corresponding peak minus $2$.
This is also (the inverse of) rowmotion on Dyck paths regarded as order ideals in the triangular poset.
Map
to partition
Description
Sends a composition to the partition obtained by sorting the entries.