Identifier
Values
[1,0] => [1,0] => [1,1,0,0] => [1,0,1,0] => 1
[1,0,1,0] => [1,0,1,0] => [1,1,0,1,0,0] => [1,1,0,0,1,0] => 1
[1,1,0,0,1,0] => [1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,1,1,0,0,0,1,0] => 1
[1,0,1,1,0,0,1,0] => [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] => 5
[1,1,0,1,0,0,1,0] => [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] => 5
[1,1,1,0,0,0,1,0] => [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,0,1,1,1,0,0,0,1,0] => [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] => 7
[1,1,0,0,1,1,0,0,1,0] => [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] => 5
[1,1,0,1,0,1,0,0,1,0] => [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] => 5
[1,1,0,1,1,0,0,0,1,0] => [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] => 7
[1,1,1,0,0,1,0,0,1,0] => [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] => 5
[1,1,1,0,1,0,0,0,1,0] => [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] => 7
[1,1,1,1,0,0,0,0,1,0] => [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,0,1,1,1,1,0,0,0,0,1,0] => [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] => 9
[1,1,0,0,1,1,1,0,0,0,1,0] => [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] => 7
[1,1,0,1,0,1,1,0,0,0,1,0] => [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] => 7
[1,1,0,1,1,0,1,0,0,0,1,0] => [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] => 7
[1,1,0,1,1,1,0,0,0,0,1,0] => [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] => 9
[1,1,1,0,0,0,1,1,0,0,1,0] => [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] => 5
[1,1,1,0,0,1,0,1,0,0,1,0] => [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] => 5
[1,1,1,0,0,1,1,0,0,0,1,0] => [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] => 7
[1,1,1,0,1,0,0,1,0,0,1,0] => [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] => 5
[1,1,1,0,1,0,1,0,0,0,1,0] => [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] => 7
[1,1,1,0,1,1,0,0,0,0,1,0] => [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] => 9
[1,1,1,1,0,0,0,1,0,0,1,0] => [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] => 5
[1,1,1,1,0,0,1,0,0,0,1,0] => [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] => 7
[1,1,1,1,0,1,0,0,0,0,1,0] => [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] => 9
[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,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,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
bounce path
Description
Sends a Dyck path $D$ of length $2n$ to its bounce path.
This path is formed by starting at the endpoint $(n,n)$ of $D$ and travelling west until encountering the first vertical step of $D$, then south until hitting the diagonal, then west again to hit $D$, etc. until the point $(0,0)$ is reached.
This map is the first part of the zeta map Mp00030zeta map.
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.