Identifier
-
Mp00043:
Integer partitions
—to Dyck path⟶
Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St001531: Dyck paths ⟶ ℤ
Values
[1] => [1,0,1,0] => [1,1,0,0] => 2
[2] => [1,1,0,0,1,0] => [1,1,0,0,1,0] => 2
[1,1] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => 4
[3] => [1,1,1,0,0,0,1,0] => [1,1,0,0,1,0,1,0] => 2
[2,1] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => 7
[1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0] => 8
[4] => [1,1,1,1,0,0,0,0,1,0] => [1,1,0,0,1,0,1,0,1,0] => 2
[3,1] => [1,1,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 4
[2,2] => [1,1,0,0,1,1,0,0] => [1,1,0,1,0,0,1,0] => 4
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,0] => 14
[1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => 16
[5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => 2
[4,1] => [1,1,1,0,1,0,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => 4
[3,2] => [1,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0] => 7
[3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => 14
[2,2,1] => [1,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0] => 25
[2,1,1,1] => [1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,1,0,0,0] => 28
[1,1,1,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 32
[5,1] => [1,1,1,1,0,1,0,0,0,0,1,0] => [1,1,0,0,1,0,1,0,1,1,0,0] => 4
[4,2] => [1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => 4
[4,1,1] => [1,1,0,1,1,0,0,0,1,0] => [1,1,0,0,1,1,0,1,0,0] => 8
[3,3] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => 4
[3,2,1] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => 40
[3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,0] => 28
[2,2,2] => [1,1,0,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0,1,0] => 8
[2,2,1,1] => [1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,0,0,0] => 50
[2,1,1,1,1] => [1,0,1,1,1,1,0,1,0,0,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => 56
[5,2] => [1,1,1,1,0,0,1,0,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => 4
[5,1,1] => [1,1,1,0,1,1,0,0,0,0,1,0] => [1,1,0,0,1,0,1,1,0,1,0,0] => 8
[4,3] => [1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0,1,0] => 7
[4,2,1] => [1,1,0,1,0,1,0,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => 14
[4,1,1,1] => [1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => 28
[3,3,1] => [1,1,0,1,0,0,1,1,0,0] => [1,1,0,1,0,0,1,1,0,0] => 8
[3,2,2] => [1,1,0,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => 14
[3,2,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,0,0] => 80
[3,1,1,1,1] => [1,0,1,1,1,1,0,0,1,0,0,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => 56
[2,2,2,1] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => 89
[2,2,1,1,1] => [1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => 100
[5,3] => [1,1,1,1,0,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => 4
[5,2,1] => [1,1,1,0,1,0,1,0,0,0,1,0] => [1,1,0,0,1,0,1,1,1,0,0,0] => 14
[5,1,1,1] => [1,1,0,1,1,1,0,0,0,0,1,0] => [1,1,0,0,1,1,0,1,0,1,0,0] => 16
[4,4] => [1,1,1,1,0,0,0,0,1,1,0,0] => [1,1,0,1,0,0,1,0,1,0,1,0] => 4
[4,3,1] => [1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => 14
[4,2,2] => [1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,0,1,0] => 14
[4,2,1,1] => [1,0,1,1,0,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0] => 49
[4,1,1,1,1] => [1,0,1,1,1,1,0,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => 56
[3,3,2] => [1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => 25
[3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,0,0] => 50
[3,2,2,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,1,0,1,1,0,0,0,0] => 145
[3,2,1,1,1] => [1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => 160
[2,2,2,2] => [1,1,0,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0,1,0] => 16
[2,2,2,1,1] => [1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => 178
[5,4] => [1,1,1,1,0,0,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0,1,0,1,0] => 7
[5,3,1] => [1,1,1,0,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => 8
[5,2,2] => [1,1,1,0,0,1,1,0,0,0,1,0] => [1,1,0,0,1,1,0,1,0,0,1,0] => 8
[5,2,1,1] => [1,1,0,1,1,0,1,0,0,0,1,0] => [1,1,0,0,1,1,0,1,1,0,0,0] => 28
[5,1,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => 56
[4,4,1] => [1,1,1,0,1,0,0,0,1,1,0,0] => [1,1,0,1,0,0,1,0,1,1,0,0] => 8
[4,3,2] => [1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0,1,0] => 40
[4,3,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => 80
[4,2,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,0] => 145
[4,2,1,1,1] => [1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => 98
[3,3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0,1,0,1,0] => 8
[3,3,2,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => 238
[3,3,1,1,1] => [1,0,1,1,1,0,0,1,1,0,0,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => 100
[3,2,2,2] => [1,1,0,0,1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,1,0,0,0,1,0] => 28
[3,2,2,1,1] => [1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => 290
[2,2,2,2,1] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => 317
[5,4,1] => [1,1,1,0,1,0,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0,1,1,0,0] => 14
[5,3,2] => [1,1,1,0,0,1,0,1,0,0,1,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => 14
[5,3,1,1] => [1,1,0,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,1,0,0,1,0,0] => 28
[5,2,2,1] => [1,1,0,1,0,1,1,0,0,0,1,0] => [1,1,0,0,1,1,1,0,1,0,0,0] => 50
[5,2,1,1,1] => [1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => 98
[4,4,2] => [1,1,1,0,0,1,0,0,1,1,0,0] => [1,1,0,1,0,0,1,1,0,0,1,0] => 8
[4,4,1,1] => [1,1,0,1,1,0,0,0,1,1,0,0] => [1,1,0,1,0,0,1,1,0,1,0,0] => 16
[4,3,3] => [1,1,1,0,0,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,0,1,0,1,0] => 14
[4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => 357
[4,3,1,1,1] => [1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => 160
[4,2,2,2] => [1,1,0,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,0,1,0] => 28
[4,2,2,1,1] => [1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => 290
[3,3,3,1] => [1,1,0,1,0,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0,1,1,0,0] => 16
[3,3,2,2] => [1,1,0,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,0,0,0,1,0] => 50
[3,3,2,1,1] => [1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => 476
[3,2,2,2,1] => [1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => 515
[5,4,2] => [1,1,1,0,0,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => 14
[5,4,1,1] => [1,1,0,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,0,1,0,0] => 28
[5,3,3] => [1,1,1,0,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,0,1,0,1,0] => 14
[5,3,2,1] => [1,1,0,1,0,1,0,1,0,0,1,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => 80
[5,3,1,1,1] => [1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => 98
[5,2,2,2] => [1,1,0,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,0,1,0,0,1,0] => 28
[5,2,2,1,1] => [1,0,1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,0,1,1,0,1,0,0,0] => 175
[4,4,3] => [1,1,1,0,0,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0,1,0,1,0] => 25
[4,4,2,1] => [1,1,0,1,0,1,0,0,1,1,0,0] => [1,1,0,1,0,0,1,1,1,0,0,0] => 28
[4,4,1,1,1] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => 100
[4,3,3,1] => [1,1,0,1,0,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,0,1,1,0,0] => 28
[4,3,2,2] => [1,1,0,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,0,0,1,0] => 80
[4,3,2,1,1] => [1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => 714
[4,2,2,2,1] => [1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => 526
[3,3,3,2] => [1,1,0,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0,1,0] => 89
[3,3,3,1,1] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => 178
[3,3,2,2,1] => [1,0,1,0,1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => 859
>>> Load all 131 entries. <<<
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
Number of partial orders contained in the poset determined by the Dyck path.
A Dyck path determines a poset, where the relations correspond to boxes under the path (seen as a North-East path). This statistic is closely related to unicellular LLT polynomials and their e-expansion.
A Dyck path determines a poset, where the relations correspond to boxes under the path (seen as a North-East path). This statistic is closely related to unicellular LLT polynomials and their e-expansion.
Map
decomposition reverse
Description
This map is recursively defined as follows.
The unique empty path of semilength $0$ is sent to itself.
Let $D$ be a Dyck path of semilength $n > 0$ and decompose it into $1 D_1 0 D_2$ with Dyck paths $D_1, D_2$ of respective semilengths $n_1$ and $n_2$ such that $n_1$ is minimal. One then has $n_1+n_2 = n-1$.
Now let $\tilde D_1$ and $\tilde D_2$ be the recursively defined respective images of $D_1$ and $D_2$ under this map. The image of $D$ is then defined as $1 \tilde D_2 0 \tilde D_1$.
The unique empty path of semilength $0$ is sent to itself.
Let $D$ be a Dyck path of semilength $n > 0$ and decompose it into $1 D_1 0 D_2$ with Dyck paths $D_1, D_2$ of respective semilengths $n_1$ and $n_2$ such that $n_1$ is minimal. One then has $n_1+n_2 = n-1$.
Now let $\tilde D_1$ and $\tilde D_2$ be the recursively defined respective images of $D_1$ and $D_2$ under this map. The image of $D$ is then defined as $1 \tilde D_2 0 \tilde D_1$.
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.
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!