Identifier
-
Mp00230:
Integer partitions
—parallelogram polyomino⟶
Dyck paths
Mp00327: Dyck paths —inverse Kreweras complement⟶ Dyck paths
St000053: Dyck paths ⟶ ℤ (values match St000015The number of peaks of a Dyck path., St001068Number of torsionless simple modules in the corresponding Nakayama algebra., St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra.)
Values
[1] => [1,0] => [1,0] => 0
[2] => [1,0,1,0] => [1,1,0,0] => 0
[1,1] => [1,1,0,0] => [1,0,1,0] => 1
[3] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => 0
[2,1] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => 1
[1,1,1] => [1,1,0,1,0,0] => [1,1,0,0,1,0] => 1
[4] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => 0
[3,1] => [1,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0] => 1
[2,2] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => 2
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,1,0,0,1,0,0] => 1
[1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,1,1,0,0,0,1,0] => 1
[5] => [1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => 0
[4,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => 1
[3,2] => [1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0] => 2
[3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => 1
[2,2,1] => [1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,0] => 2
[2,1,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,1,1,1,0,0,0,1,0,0] => 1
[1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => 1
[6] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => 0
[5,1] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => 1
[4,2] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => 2
[4,1,1] => [1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => 1
[3,3] => [1,1,1,0,1,0,0,0] => [1,0,1,1,0,0,1,0] => 2
[3,2,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,1,0,0,1,0,0] => 2
[3,1,1,1] => [1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => 1
[2,2,2] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => 3
[2,2,1,1] => [1,1,1,0,0,1,0,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => 2
[2,1,1,1,1] => [1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => 1
[1,1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,1,0,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => 1
[7] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => 0
[6,1] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,1,0,1,0,0,0,0,0,0] => 1
[5,2] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => 2
[5,1,1] => [1,0,1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,1,1,1,1,0,0,1,0,0,0,0,0] => 1
[4,3] => [1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,0,0,1,0,0] => 2
[4,2,1] => [1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => 2
[4,1,1,1] => [1,0,1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,1,1,1,1,0,0,0,1,0,0,0,0] => 1
[3,3,1] => [1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => 2
[3,2,2] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => 3
[3,2,1,1] => [1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => 2
[3,1,1,1,1] => [1,0,1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,1,1,1,1,0,0,0,0,1,0,0,0] => 1
[2,2,2,1] => [1,1,1,1,0,0,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => 3
[2,2,1,1,1] => [1,1,1,0,0,1,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,0,0,1,0] => 2
[2,1,1,1,1,1] => [1,0,1,1,0,1,0,1,0,1,0,1,0,0] => [1,1,1,1,1,1,0,0,0,0,0,1,0,0] => 1
[1,1,1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,1,0,1,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => 1
[6,2] => [1,0,1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,1,0,1,0,1,0,0,0,0,0] => 2
[5,3] => [1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => 2
[5,2,1] => [1,0,1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,1,1,1,0,1,0,0,1,0,0,0,0] => 2
[4,4] => [1,1,1,0,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0,1,0] => 2
[4,3,1] => [1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => 2
[4,2,2] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => 3
[4,2,1,1] => [1,0,1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,1,1,0,1,1,0,0,0,1,0,0,0] => 2
[3,3,2] => [1,1,1,0,1,1,0,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => 3
[3,3,1,1] => [1,1,1,0,1,0,0,1,0,1,0,0] => [1,1,1,0,0,1,1,0,0,0,1,0] => 2
[3,2,2,1] => [1,0,1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => 3
[3,2,1,1,1] => [1,0,1,1,1,0,0,1,0,1,0,1,0,0] => [1,1,1,0,1,1,1,0,0,0,0,1,0,0] => 2
[2,2,2,2] => [1,1,1,1,0,1,0,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => 3
[2,2,2,1,1] => [1,1,1,1,0,0,0,1,0,1,0,0] => [1,1,0,1,0,1,1,0,0,0,1,0] => 3
[2,2,1,1,1,1] => [1,1,1,0,0,1,0,1,0,1,0,1,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0,1,0] => 2
[6,3] => [1,0,1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,1,0,0,1,0,0,0,0] => 2
[5,4] => [1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => 2
[5,3,1] => [1,0,1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,1,0,0,1,0,0,1,0,0,0] => 2
[5,2,2] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,1,0,1,0,1,0,0,0,0] => 3
[4,4,1] => [1,1,1,0,1,0,1,0,0,1,0,0] => [1,1,1,1,0,0,0,1,0,0,1,0] => 2
[4,3,2] => [1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => 3
[4,3,1,1] => [1,0,1,1,1,0,1,0,0,1,0,1,0,0] => [1,1,1,1,0,0,1,1,0,0,0,1,0,0] => 2
[4,2,2,1] => [1,0,1,0,1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,0,1,0,1,0,0,1,0,0,0] => 3
[3,3,3] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 4
[3,3,2,1] => [1,1,1,0,1,1,0,0,0,1,0,0] => [1,1,1,0,0,1,0,1,0,0,1,0] => 3
[3,3,1,1,1] => [1,1,1,0,1,0,0,1,0,1,0,1,0,0] => [1,1,1,0,0,1,1,1,0,0,0,0,1,0] => 2
[3,2,2,2] => [1,0,1,1,1,1,0,1,0,0,0,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => 3
[3,2,2,1,1] => [1,0,1,1,1,1,0,0,0,1,0,1,0,0] => [1,1,1,0,1,0,1,1,0,0,0,1,0,0] => 3
[2,2,2,2,1] => [1,1,1,1,0,1,0,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,0,1,0] => 3
[2,2,2,1,1,1] => [1,1,1,1,0,0,0,1,0,1,0,1,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0,1,0] => 3
[6,4] => [1,0,1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,1,0,1,1,1,0,0,0,1,0,0,0] => 2
[5,5] => [1,1,1,0,1,0,1,0,1,0,0,0] => [1,0,1,1,1,1,0,0,0,0,1,0] => 2
[5,4,1] => [1,0,1,1,1,0,1,0,1,0,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,1,0,0] => 2
[5,3,2] => [1,0,1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,1,1,0,0,1,0,1,0,0,0] => 3
[4,4,2] => [1,1,1,0,1,0,1,1,0,0,0,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => 3
[4,4,1,1] => [1,1,1,0,1,0,1,0,0,1,0,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0,1,0] => 2
[4,3,3] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 4
[4,3,2,1] => [1,0,1,1,1,0,1,1,0,0,0,1,0,0] => [1,1,1,1,0,0,1,0,1,0,0,1,0,0] => 3
[4,2,2,2] => [1,0,1,0,1,1,1,1,0,1,0,0,0,0] => [1,1,1,0,1,0,1,1,0,0,1,0,0,0] => 3
[3,3,3,1] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,1,0,1,0,1,0,1,0,0,1,0] => 4
[3,3,2,2] => [1,1,1,0,1,1,0,1,0,0,0,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => 3
[3,3,2,1,1] => [1,1,1,0,1,1,0,0,0,1,0,1,0,0] => [1,1,1,0,0,1,0,1,1,0,0,0,1,0] => 3
[3,2,2,2,1] => [1,0,1,1,1,1,0,1,0,0,0,1,0,0] => [1,1,1,0,1,1,0,0,1,0,0,1,0,0] => 3
[2,2,2,2,2] => [1,1,1,1,0,1,0,1,0,0,0,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => 3
[2,2,2,2,1,1] => [1,1,1,1,0,1,0,0,0,1,0,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0,1,0] => 3
[6,5] => [1,0,1,1,1,0,1,0,1,0,1,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,1,0,0] => 2
[5,5,1] => [1,1,1,0,1,0,1,0,1,0,0,1,0,0] => [1,1,1,1,1,0,0,0,0,1,0,0,1,0] => 2
[5,4,2] => [1,0,1,1,1,0,1,0,1,1,0,0,0,0] => [1,1,0,1,1,1,0,0,0,1,0,1,0,0] => 3
[5,3,3] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,0,1,0,1,0,1,0,1,0,0,0] => 4
[4,4,3] => [1,1,1,0,1,1,1,0,0,0,0,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => 4
[4,4,2,1] => [1,1,1,0,1,0,1,1,0,0,0,1,0,0] => [1,1,1,1,0,0,0,1,0,1,0,0,1,0] => 3
[4,3,3,1] => [1,0,1,1,1,1,1,0,0,0,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,0,1,0,0] => 4
[4,3,2,2] => [1,0,1,1,1,0,1,1,0,1,0,0,0,0] => [1,1,0,1,1,0,0,1,1,0,0,1,0,0] => 3
[3,3,3,2] => [1,1,1,1,1,0,0,1,0,0,0,0] => [1,0,1,0,1,1,0,1,0,0,1,0] => 4
[3,3,3,1,1] => [1,1,1,1,1,0,0,0,0,1,0,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0,1,0] => 4
[3,3,2,2,1] => [1,1,1,0,1,1,0,1,0,0,0,1,0,0] => [1,1,1,0,0,1,1,0,0,1,0,0,1,0] => 3
[3,2,2,2,2] => [1,0,1,1,1,1,0,1,0,1,0,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,1,0,0] => 3
[2,2,2,2,2,1] => [1,1,1,1,0,1,0,1,0,0,0,1,0,0] => [1,1,0,1,1,1,0,0,0,1,0,0,1,0] => 3
>>> Load all 127 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
The number of valleys of the Dyck path.
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
inverse Kreweras complement
Description
Return the inverse of the Kreweras complement of a Dyck path, regarded as a noncrossing set partition.
To identify Dyck paths and noncrossing set partitions, this maps uses the following classical bijection. The number of down steps after the $i$-th up step of the Dyck path is the size of the block of the set partition whose maximal element is $i$. If $i$ is not a maximal element of a block, the $(i+1)$-st step is also an up step.
To identify Dyck paths and noncrossing set partitions, this maps uses the following classical bijection. The number of down steps after the $i$-th up step of the Dyck path is the size of the block of the set partition whose maximal element is $i$. If $i$ is not a maximal element of a block, the $(i+1)$-st step is also an up step.
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!