Identifier
Values
[1,1] => [1,0,1,0] => [1] => [1,0,1,0] => 1
[1,2] => [1,0,1,1,0,0] => [1,1] => [1,0,1,1,0,0] => 2
[2,1] => [1,1,0,0,1,0] => [2] => [1,1,0,0,1,0] => 1
[1,2,1] => [1,0,1,1,0,0,1,0] => [3,1,1] => [1,0,1,1,0,0,1,0] => 3
[1,3] => [1,0,1,1,1,0,0,0] => [1,1,1] => [1,0,1,1,1,0,0,0] => 3
[2,2] => [1,1,0,0,1,1,0,0] => [2,2] => [1,1,0,0,1,1,0,0] => 2
[3,1] => [1,1,1,0,0,0,1,0] => [3] => [1,1,1,0,0,0,1,0] => 1
[1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => 4
[1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [4,1,1,1] => [1,0,1,1,1,0,0,0,1,0] => 4
[1,4] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => 4
[2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [4,2,2] => [1,1,0,0,1,1,0,0,1,0] => 3
[2,3] => [1,1,0,0,1,1,1,0,0,0] => [2,2,2] => [1,1,0,0,1,1,1,0,0,0] => 3
[3,2] => [1,1,1,0,0,0,1,1,0,0] => [3,3] => [1,1,1,0,0,0,1,1,0,0] => 2
[4,1] => [1,1,1,1,0,0,0,0,1,0] => [4] => [1,1,1,1,0,0,0,0,1,0] => 1
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => [5,3,3,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => 5
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => [3,3,3,1,1] => [1,0,1,1,0,0,1,1,1,0,0,0] => 5
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => [4,4,1,1,1] => [1,0,1,1,1,0,0,0,1,1,0,0] => 5
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [5,1,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => 5
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0] => 5
[2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => [4,4,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => 4
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => [5,2,2,2] => [1,1,0,0,1,1,1,0,0,0,1,0] => 4
[2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => [2,2,2,2] => [1,1,0,0,1,1,1,1,0,0,0,0] => 4
[3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => [5,3,3] => [1,1,1,0,0,0,1,1,0,0,1,0] => 3
[3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [3,3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => 3
[4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => [4,4] => [1,1,1,1,0,0,0,0,1,1,0,0] => 2
[5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => 1
[1,2,2,2] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [5,5,3,3,1,1] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => 6
[1,2,3,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0] => [6,3,3,3,1,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0] => 6
[1,2,4] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0] => [3,3,3,3,1,1] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0] => 6
[1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0] => [6,4,4,1,1,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0] => 6
[1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0] => [4,4,4,1,1,1] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0] => 6
[1,4,2] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0] => [5,5,1,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0] => 6
[1,5,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => [6,1,1,1,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => 6
[1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,1] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => 6
[2,2,2,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0] => [6,4,4,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0] => 5
[2,2,3] => [1,1,0,0,1,1,0,0,1,1,1,0,0,0] => [4,4,4,2,2] => [1,1,0,0,1,1,0,0,1,1,1,0,0,0] => 5
[2,3,2] => [1,1,0,0,1,1,1,0,0,0,1,1,0,0] => [5,5,2,2,2] => [1,1,0,0,1,1,1,0,0,0,1,1,0,0] => 5
[2,4,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0] => [6,2,2,2,2] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0] => 5
[2,5] => [1,1,0,0,1,1,1,1,1,0,0,0,0,0] => [2,2,2,2,2] => [1,1,0,0,1,1,1,1,1,0,0,0,0,0] => 5
[3,2,2] => [1,1,1,0,0,0,1,1,0,0,1,1,0,0] => [5,5,3,3] => [1,1,1,0,0,0,1,1,0,0,1,1,0,0] => 4
[3,3,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0] => [6,3,3,3] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0] => 4
[3,4] => [1,1,1,0,0,0,1,1,1,1,0,0,0,0] => [3,3,3,3] => [1,1,1,0,0,0,1,1,1,1,0,0,0,0] => 4
[4,2,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0] => [6,4,4] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0] => 3
[4,3] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0] => [4,4,4] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0] => 3
[5,2] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0] => [5,5] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0] => 2
[6,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => [6] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => 1
search for individual values
searching the database for the individual values of this statistic
Description
The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2.
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.
Map
to partition
Description
The cut-out partition of a Dyck path.
The partition $\lambda$ associated to a Dyck path is defined to be the complementary partition inside the staircase partition $(n-1,\ldots,2,1)$ when cutting out $D$ considered as a path from $(0,0)$ to $(n,n)$.
In other words, $\lambda_{i}$ is the number of down-steps before the $(n+1-i)$-th up-step of $D$.
This map is a bijection between Dyck paths of size $n$ and partitions inside the staircase partition $(n-1,\ldots,2,1)$.
Map
bounce path
Description
The bounce path determined by an integer composition.