Identifier
Values
[1,0] => [1,1,0,0] => [1,0,1,0] => [1,0,1,0] => 1
[1,0,1,0] => [1,1,0,1,0,0] => [1,1,0,0,1,0] => [1,1,0,0,1,0] => 1
[1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [1,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => 3
[1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,0] => 1
[1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,0,1,0] => 5
[1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => 3
[1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => 4
[1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,0,0,0,0,1,0] => 1
[1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [1,1,0,1,1,1,0,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,0,1,0] => 7
[1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => [1,1,1,0,0,1,1,0,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0,1,0] => 5
[1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => [1,1,1,0,1,0,0,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => 5
[1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => [1,1,1,0,1,1,0,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,0,1,0] => 7
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [1,1,1,1,0,0,0,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => 3
[1,1,1,0,0,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0,1,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => 4
[1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => [1,1,1,1,0,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0,1,0] => 5
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => 1
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,0,1,1,1,0,0,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0,1,0] => [1,0,1,1,1,0,0,1,1,0,0,0,1,0] => 8
[1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,0,1,1,1,1,0,0,0,0,1,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0,1,0] => [1,1,0,1,1,1,1,0,0,0,0,0,1,0] => 9
[1,1,0,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,1,1,1,0,0,0,0,1,0] => [1,1,1,0,0,1,1,1,0,0,0,0,1,0] => 7
[1,1,0,1,1,0,0,0,1,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,1,0,0] => [1,1,1,0,1,1,0,0,0,1,0,0,1,0] => [1,1,0,1,1,0,0,0,1,1,0,0,1,0] => 7
[1,1,0,1,1,1,0,0,0,0,1,0] => [1,1,1,0,1,1,1,0,0,0,0,1,0,0] => [1,1,1,0,1,1,1,0,0,0,0,0,1,0] => [1,1,1,0,1,1,1,0,0,0,0,0,1,0] => 10
[1,1,1,0,0,0,1,1,0,0,1,0] => [1,1,1,1,0,0,0,1,1,0,0,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,1,0,0,0,1,0] => 5
[1,1,1,0,0,1,0,0,1,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0] => 5
[1,1,1,0,0,1,1,0,0,0,1,0] => [1,1,1,1,0,0,1,1,0,0,0,1,0,0] => [1,1,1,1,0,0,1,1,0,0,0,0,1,0] => [1,1,1,1,0,0,1,1,0,0,0,0,1,0] => 7
[1,1,1,0,1,0,0,0,1,0,1,0] => [1,1,1,1,0,1,0,0,0,1,0,1,0,0] => [1,1,1,1,0,1,0,0,0,1,0,0,1,0] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0] => 6
[1,1,1,0,1,0,0,1,0,0,1,0] => [1,1,1,1,0,1,0,0,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0,1,0] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0] => 6
[1,1,1,0,1,1,0,0,0,0,1,0] => [1,1,1,1,0,1,1,0,0,0,0,1,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0,1,0] => [1,1,1,1,0,1,1,0,0,0,0,0,1,0] => 9
[1,1,1,1,0,0,0,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,1,0,0] => [1,1,1,1,1,0,0,0,0,1,0,0,1,0] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0] => 3
[1,1,1,1,0,0,0,1,0,0,1,0] => [1,1,1,1,1,0,0,0,1,0,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0,1,0] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0] => 4
[1,1,1,1,0,0,1,0,0,0,1,0] => [1,1,1,1,1,0,0,1,0,0,0,1,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0,1,0] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0] => 5
[1,1,1,1,0,1,0,0,0,0,1,0] => [1,1,1,1,1,0,1,0,0,0,0,1,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => 6
[1,1,1,1,1,0,0,0,0,0,1,0] => [1,1,1,1,1,1,0,0,0,0,0,1,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => 1
[] => [1,0] => [1,0] => [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 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
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
Map
swap returns and last descent
Description
Return a Dyck path with number of returns and length of the last descent interchanged.
This is the specialisation of the map $\Phi$ in [1] to Dyck paths. It is characterised by the fact that the number of up steps before a down step that is neither a return nor part of the last descent is preserved.