Identifier
Values
[1,0] => [1,1,0,0] => [1,1,0,0] => [1,0,1,0] => 1
[1,0,1,0] => [1,1,0,1,0,0] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => 2
[1,1,0,0] => [1,1,1,0,0,0] => [1,1,1,0,0,0] => [1,1,0,0,1,0] => 1
[1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => 2
[1,1,0,1,0,0] => [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
[1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0] => [1,1,1,0,0,0,1,0] => 1
[1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => 2
[1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => 2
[1,1,1,0,1,0,0,0] => [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,0,1,0,0] => 2
[1,1,1,1,0,0,0,0] => [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,0,0,0,1,0] => 1
[1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,1,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,0,0,1,0,0] => 2
[1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,1,1,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,0,0,1,0,0] => 2
[1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,1,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,0,0,1,0,0] => 2
[1,1,1,1,0,1,0,0,0,0] => [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,0,0,1,0,0] => 2
[1,1,1,1,1,0,0,0,0,0] => [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,0,0,0,0,1,0] => 1
[1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,0,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,1,1,1,1,1,0,0,0,0,0,1,0,0] => 2
[1,1,0,1,1,1,1,0,0,0,0,0] => [1,1,1,0,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,1,1,1,1,1,0,0,0,0,0,1,0,0] => 2
[1,1,1,0,1,1,1,0,0,0,0,0] => [1,1,1,1,0,1,1,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,0,0,0,1,0,0] => 2
[1,1,1,1,0,1,1,0,0,0,0,0] => [1,1,1,1,1,0,1,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,0,0,0,1,0,0] => 2
[1,1,1,1,1,0,1,0,0,0,0,0] => [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,0,0,0,1,0,0] => 2
[1,1,1,1,1,1,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,1,0,0,0,0,0,0,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
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
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
Knuth-Krattenthaler
Description
The map that sends the Dyck path to a 321-avoiding permutation, then applies the Robinson-Schensted correspondence and finally interprets the first row of the insertion tableau and the second row of the recording tableau as up steps.
Interpreting a pair of two-row standard tableaux of the same shape as a Dyck path is explained by Knuth in [1, pp. 60].
Krattenthaler's bijection between Dyck paths and $321$-avoiding permutations used is Mp00119to 321-avoiding permutation (Krattenthaler), see [2].
This is the inverse of the map Mp00127left-to-right-maxima to Dyck path that interprets the left-to-right maxima of the permutation obtained from Mp00024to 321-avoiding permutation as a Dyck path.