Identifier
-
Mp00230:
Integer partitions
—parallelogram polyomino⟶
Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001204: Dyck paths ⟶ ℤ
Values
[3] => [1,0,1,0,1,0] => [2,1] => [1,0,1,1,0,0] => 1
[2,1] => [1,0,1,1,0,0] => [1,1] => [1,1,0,0] => 0
[4] => [1,0,1,0,1,0,1,0] => [3,2,1] => [1,0,1,1,1,0,0,1,0,0] => 1
[3,1] => [1,0,1,0,1,1,0,0] => [2,2,1] => [1,1,1,0,0,1,0,0] => 0
[2,1,1] => [1,0,1,1,0,1,0,0] => [2,1,1] => [1,0,1,1,0,1,0,0] => 1
[1,1,1,1] => [1,1,0,1,0,1,0,0] => [2,1] => [1,0,1,1,0,0] => 1
[4,1] => [1,0,1,0,1,0,1,1,0,0] => [3,3,2,1] => [1,1,1,0,1,1,0,0,0,1,0,0] => 0
[3,2] => [1,0,1,1,1,0,0,0] => [1,1,1] => [1,1,0,1,0,0] => 0
[3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [3,2,2,1] => [1,0,1,1,1,1,0,0,0,1,0,0] => 1
[2,2,1] => [1,1,1,0,0,1,0,0] => [2] => [1,0,1,0] => 1
[2,1,1,1] => [1,0,1,1,0,1,0,1,0,0] => [3,2,1,1] => [1,0,1,1,1,0,0,1,0,1,0,0] => 1
[1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => [3,2,1] => [1,0,1,1,1,0,0,1,0,0] => 1
[4,2] => [1,0,1,0,1,1,1,0,0,0] => [2,2,2,1] => [1,1,1,1,0,0,0,1,0,0] => 0
[3,2,1] => [1,0,1,1,1,0,0,1,0,0] => [3,1,1,1] => [1,0,1,0,1,1,0,1,0,1,0,0] => 1
[2,2,1,1] => [1,1,1,0,0,1,0,1,0,0] => [3,2] => [1,0,1,1,1,0,0,0] => 1
[4,3] => [1,0,1,1,1,0,1,0,0,0] => [2,1,1,1] => [1,0,1,1,0,1,0,1,0,0] => 1
[3,3,1] => [1,1,1,0,1,0,0,1,0,0] => [3,1] => [1,0,1,0,1,1,0,0] => 1
[3,2,2] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1] => [1,1,0,1,0,1,0,0] => 0
[2,2,2,1] => [1,1,1,1,0,0,0,1,0,0] => [3] => [1,0,1,0,1,0] => 1
[2,2,1,1,1] => [1,1,1,0,0,1,0,1,0,1,0,0] => [4,3,2] => [1,0,1,1,1,0,1,1,0,0,0,0] => 1
[4,4] => [1,1,1,0,1,0,1,0,0,0] => [2,1] => [1,0,1,1,0,0] => 1
[4,2,2] => [1,0,1,0,1,1,1,1,0,0,0,0] => [2,2,2,2,1] => [1,1,1,1,0,1,0,0,0,1,0,0] => 0
[3,3,2] => [1,1,1,0,1,1,0,0,0,0] => [1,1] => [1,1,0,0] => 0
[3,3,1,1] => [1,1,1,0,1,0,0,1,0,1,0,0] => [4,3,1] => [1,0,1,1,1,0,1,0,0,1,0,0] => 1
[2,2,2,1,1] => [1,1,1,1,0,0,0,1,0,1,0,0] => [4,3] => [1,0,1,1,1,0,1,0,0,0] => 1
[4,4,1] => [1,1,1,0,1,0,1,0,0,1,0,0] => [4,2,1] => [1,0,1,0,1,1,1,0,0,1,0,0] => 1
[4,3,2] => [1,0,1,1,1,0,1,1,0,0,0,0] => [2,2,1,1,1] => [1,1,1,0,0,1,0,1,0,1,0,0] => 0
[3,3,2,1] => [1,1,1,0,1,1,0,0,0,1,0,0] => [4,1,1] => [1,0,1,0,1,0,1,1,0,1,0,0] => 1
[3,2,2,2] => [1,0,1,1,1,1,0,1,0,0,0,0] => [2,1,1,1,1] => [1,0,1,1,0,1,0,1,0,1,0,0] => 1
[2,2,2,2,1] => [1,1,1,1,0,1,0,0,0,1,0,0] => [4,1] => [1,0,1,0,1,0,1,1,0,0] => 1
[5,5] => [1,1,1,0,1,0,1,0,1,0,0,0] => [3,2,1] => [1,0,1,1,1,0,0,1,0,0] => 1
[4,4,2] => [1,1,1,0,1,0,1,1,0,0,0,0] => [2,2,1] => [1,1,1,0,0,1,0,0] => 0
[4,3,3] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => 0
[3,3,3,1] => [1,1,1,1,1,0,0,0,0,1,0,0] => [4] => [1,0,1,0,1,0,1,0] => 1
[3,3,2,2] => [1,1,1,0,1,1,0,1,0,0,0,0] => [2,1,1] => [1,0,1,1,0,1,0,0] => 1
[2,2,2,2,2] => [1,1,1,1,0,1,0,1,0,0,0,0] => [2,1] => [1,0,1,1,0,0] => 1
[4,4,3] => [1,1,1,0,1,1,1,0,0,0,0,0] => [1,1,1] => [1,1,0,1,0,0] => 0
[3,3,3,2] => [1,1,1,1,1,0,0,1,0,0,0,0] => [2] => [1,0,1,0] => 1
[3,3,3,1,1] => [1,1,1,1,1,0,0,0,0,1,0,1,0,0] => [5,4] => [1,0,1,1,1,0,1,0,1,0,0,0] => 1
[5,5,2] => [1,1,1,0,1,0,1,0,1,1,0,0,0,0] => [3,3,2,1] => [1,1,1,0,1,1,0,0,0,1,0,0] => 0
[4,4,2,2] => [1,1,1,0,1,0,1,1,0,1,0,0,0,0] => [3,2,2,1] => [1,0,1,1,1,1,0,0,0,1,0,0] => 1
[3,3,3,2,1] => [1,1,1,1,1,0,0,1,0,0,0,1,0,0] => [5,2] => [1,0,1,0,1,0,1,1,1,0,0,0] => 1
[3,3,2,2,2] => [1,1,1,0,1,1,0,1,0,1,0,0,0,0] => [3,2,1,1] => [1,0,1,1,1,0,0,1,0,1,0,0] => 1
[2,2,2,2,2,2] => [1,1,1,1,0,1,0,1,0,1,0,0,0,0] => [3,2,1] => [1,0,1,1,1,0,0,1,0,0] => 1
[5,5,3] => [1,1,1,0,1,0,1,1,1,0,0,0,0,0] => [2,2,2,1] => [1,1,1,1,0,0,0,1,0,0] => 0
[4,4,4,1] => [1,1,1,1,1,0,1,0,0,0,0,1,0,0] => [5,1] => [1,0,1,0,1,0,1,0,1,1,0,0] => 1
[4,4,3,2] => [1,1,1,0,1,1,1,0,0,1,0,0,0,0] => [3,1,1,1] => [1,0,1,0,1,1,0,1,0,1,0,0] => 1
[4,3,3,3] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,1,0,0] => 0
[3,3,3,3,1] => [1,1,1,1,1,1,0,0,0,0,0,1,0,0] => [5] => [1,0,1,0,1,0,1,0,1,0] => 1
[3,3,3,2,2] => [1,1,1,1,1,0,0,1,0,1,0,0,0,0] => [3,2] => [1,0,1,1,1,0,0,0] => 1
[5,5,4] => [1,1,1,0,1,1,1,0,1,0,0,0,0,0] => [2,1,1,1] => [1,0,1,1,0,1,0,1,0,0] => 1
[4,4,4,2] => [1,1,1,1,1,0,1,0,0,1,0,0,0,0] => [3,1] => [1,0,1,0,1,1,0,0] => 1
[4,4,3,3] => [1,1,1,0,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1] => [1,1,0,1,0,1,0,0] => 0
[3,3,3,3,2] => [1,1,1,1,1,1,0,0,0,1,0,0,0,0] => [3] => [1,0,1,0,1,0] => 1
[5,5,5] => [1,1,1,1,1,0,1,0,1,0,0,0,0,0] => [2,1] => [1,0,1,1,0,0] => 1
[4,4,4,3] => [1,1,1,1,1,0,1,1,0,0,0,0,0,0] => [1,1] => [1,1,0,0] => 0
[3,3,3,2,2,2] => [1,1,1,1,1,0,0,1,0,1,0,1,0,0,0,0] => [4,3,2] => [1,0,1,1,1,0,1,1,0,0,0,0] => 1
[5,5,3,3] => [1,1,1,0,1,0,1,1,1,1,0,0,0,0,0,0] => [2,2,2,2,1] => [1,1,1,1,0,1,0,0,0,1,0,0] => 0
[4,4,4,2,2] => [1,1,1,1,1,0,1,0,0,1,0,1,0,0,0,0] => [4,3,1] => [1,0,1,1,1,0,1,0,0,1,0,0] => 1
[3,3,3,3,2,2] => [1,1,1,1,1,1,0,0,0,1,0,1,0,0,0,0] => [4,3] => [1,0,1,1,1,0,1,0,0,0] => 1
[5,5,5,2] => [1,1,1,1,1,0,1,0,1,0,0,1,0,0,0,0] => [4,2,1] => [1,0,1,0,1,1,1,0,0,1,0,0] => 1
[5,5,4,3] => [1,1,1,0,1,1,1,0,1,1,0,0,0,0,0,0] => [2,2,1,1,1] => [1,1,1,0,0,1,0,1,0,1,0,0] => 0
[4,4,4,4,1] => [1,1,1,1,1,1,1,0,0,0,0,0,0,1,0,0] => [6] => [1,0,1,0,1,0,1,0,1,0,1,0] => 1
[4,4,4,3,2] => [1,1,1,1,1,0,1,1,0,0,0,1,0,0,0,0] => [4,1,1] => [1,0,1,0,1,0,1,1,0,1,0,0] => 1
[4,4,3,3,3] => [1,1,1,0,1,1,1,1,0,1,0,0,0,0,0,0] => [2,1,1,1,1] => [1,0,1,1,0,1,0,1,0,1,0,0] => 1
[3,3,3,3,3,2] => [1,1,1,1,1,1,0,1,0,0,0,1,0,0,0,0] => [4,1] => [1,0,1,0,1,0,1,1,0,0] => 1
[4,4,4,4,2] => [1,1,1,1,1,1,1,0,0,0,0,1,0,0,0,0] => [4] => [1,0,1,0,1,0,1,0] => 1
[3,3,3,3,3,3] => [1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0] => [2,1] => [1,0,1,1,0,0] => 1
[3,3,3,3,3,3,3] => [1,1,1,1,1,1,0,1,0,1,0,1,0,0,0,0,0,0] => [3,2,1] => [1,0,1,1,1,0,0,1,0,0] => 1
[4,4,4,3,3,3] => [1,1,1,1,1,0,1,1,0,1,0,1,0,0,0,0,0,0] => [3,2,1,1] => [1,0,1,1,1,0,0,1,0,1,0,0] => 1
[6,6,6,6] => [1,1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0,0] => [2,1] => [1,0,1,1,0,0] => 1
[6,6,6] => [1,1,1,1,1,0,1,0,1,0,1,0,0,0,0,0] => [3,2,1] => [1,0,1,1,1,0,0,1,0,0] => 1
[7,7,7,7] => [1,1,1,1,1,1,1,0,1,0,1,0,1,0,0,0,0,0,0,0] => [3,2,1] => [1,0,1,1,1,0,0,1,0,0] => 1
[4,4,4,4,4,4,4] => [1,1,1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0,0,0] => [2,1] => [1,0,1,1,0,0] => 1
search for individual values
searching the database for the individual values of this statistic
Description
Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra.
Associate to this special CNakayama algebra a Dyck path as follows:
In the list L delete the first entry $c_0$ and substract from all other entries $n$−1 and then append the last element 1. The result is a Kupisch series of an LNakayama algebra.
The statistic gives the $(t-1)/2$ when $t$ is the projective dimension of the simple module $S_{n-2}$.
Associate to this special CNakayama algebra a Dyck path as follows:
In the list L delete the first entry $c_0$ and substract from all other entries $n$−1 and then append the last element 1. The result is a Kupisch series of an LNakayama algebra.
The statistic gives the $(t-1)/2$ when $t$ is the projective dimension of the simple module $S_{n-2}$.
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.
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
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)$.
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)$.
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!