Processing math: 100%

Identifier
Values
[1] => [1,0] => [1,0] => [1,0] => 0
[2] => [1,0,1,0] => [1,0,1,0] => [1,1,0,0] => 0
[1,1] => [1,1,0,0] => [1,1,0,0] => [1,0,1,0] => 1
[3] => [1,0,1,0,1,0] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => 0
[1,1,1] => [1,1,0,1,0,0] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 1
[4] => [1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => 0
[2,2] => [1,1,1,0,0,0] => [1,1,1,0,0,0] => [1,1,0,1,0,0] => 2
[1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => 1
[5] => [1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => 0
[2,2,1] => [1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => 3
[1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => 1
[6] => [1,0,1,0,1,0,1,0,1,0,1,0] => [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
[3,3] => [1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => 2
[2,2,2] => [1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0] => [1,1,1,0,1,0,0,0] => 3
[2,2,1,1] => [1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => 4
[1,1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,1,0,0] => [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
[7] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [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
[3,3,1] => [1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => 3
[2,2,2,1] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => 5
[2,2,1,1,1] => [1,1,1,0,0,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,0,0,0,0,1,0] => 5
[1,1,1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,1,0,1,0,0] => [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
[4,4] => [1,1,1,0,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => 2
[3,3,1,1] => [1,1,1,0,1,0,0,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => 4
[2,2,2,2] => [1,1,1,1,0,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => 3
[2,2,2,1,1] => [1,1,1,1,0,0,0,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,1,0,0] => [1,1,0,1,1,1,0,0,0,0,1,0] => 7
[2,2,1,1,1,1] => [1,1,1,0,0,1,0,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => 6
[4,4,1] => [1,1,1,0,1,0,1,0,0,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => 3
[3,3,3] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => 4
[3,3,1,1,1] => [1,1,1,0,1,0,0,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0] => 5
[2,2,2,2,1] => [1,1,1,1,0,1,0,0,0,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0,1,0] => 5
[2,2,2,1,1,1] => [1,1,1,1,0,0,0,1,0,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0,1,1,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0,1,0] => 9
[5,5] => [1,1,1,0,1,0,1,0,1,0,0,0] => [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
[4,4,1,1] => [1,1,1,0,1,0,1,0,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0] => 4
[3,3,3,1] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => [1,1,1,0,1,1,0,0,0,0,1,0] => 7
[2,2,2,2,2] => [1,1,1,1,0,1,0,1,0,0,0,0] => [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,2,2,2,1,1] => [1,1,1,1,0,1,0,0,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,1,1,0,0,0,0,1,0] => 7
[5,5,1] => [1,1,1,0,1,0,1,0,1,0,0,1,0,0] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0] => 3
[3,3,3,2] => [1,1,1,1,1,0,0,1,0,0,0,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,1,0,0,0] => 7
[3,3,3,1,1] => [1,1,1,1,1,0,0,0,0,1,0,1,0,0] => [1,1,1,1,0,0,0,0,1,0,1,1,0,0] => [1,1,1,0,1,1,1,0,0,0,0,0,1,0] => 10
[2,2,2,2,2,1] => [1,1,1,1,0,1,0,1,0,0,0,1,0,0] => [1,0,1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0,1,0] => 5
[6,6] => [1,1,1,0,1,0,1,0,1,0,1,0,0,0] => [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,4,4] => [1,1,1,1,1,0,1,0,0,0,0,0] => [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] => [1,1,1,1,1,1,0,0,0,0,0,0] => [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
[3,3,3,2,1] => [1,1,1,1,1,0,0,1,0,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0,1,1,0,0] => [1,0,1,1,1,0,0,1,1,0,0,0,1,0] => 8
[2,2,2,2,2,2] => [1,1,1,1,0,1,0,1,0,1,0,0,0,0] => [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
[4,4,4,1] => [1,1,1,1,1,0,1,0,0,0,0,1,0,0] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0] => [1,1,1,1,0,0,1,1,0,0,0,0,1,0] => 7
[3,3,3,3,1] => [1,1,1,1,1,1,0,0,0,0,0,1,0,0] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0,1,0] => 9
[3,3,3,2,2] => [1,1,1,1,1,0,0,1,0,1,0,0,0,0] => [1,1,0,0,1,0,1,1,1,1,0,0,0,0] => [1,0,1,1,1,1,1,0,0,0,1,0,0,0] => 8
[4,4,4,2] => [1,1,1,1,1,0,1,0,0,1,0,0,0,0] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0] => [1,1,0,0,1,1,1,1,0,0,1,0,0,0] => 7
[3,3,3,3,2] => [1,1,1,1,1,1,0,0,0,1,0,0,0,0] => [1,1,1,0,0,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,1,1,0,0,0,1,0,0,0] => 11
[5,5,5] => [1,1,1,1,1,0,1,0,1,0,0,0,0,0] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,1,0,0,0,0] => 4
[3,3,3,3,3] => [1,1,1,1,1,1,0,1,0,0,0,0,0,0] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,1,0,0,1,0,0,0,0,0] => 5
[4,4,4,4] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,1,1,1,1,1,0,1,0,0,0,0,0,0] => 6
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
switch returns and last double rise
Description
An alternative to the Adin-Bagno-Roichman transformation of a Dyck path.
This is a bijection preserving the number of up steps before each peak and exchanging the number of components with the position of the last double rise.
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.