Identifier
-
Mp00230:
Integer partitions
—parallelogram polyomino⟶
Dyck paths
St000335: Dyck paths ⟶ ℤ
Values
[1] => [1,0] => 1
[2] => [1,0,1,0] => 1
[1,1] => [1,1,0,0] => 2
[3] => [1,0,1,0,1,0] => 1
[2,1] => [1,0,1,1,0,0] => 2
[1,1,1] => [1,1,0,1,0,0] => 1
[4] => [1,0,1,0,1,0,1,0] => 1
[3,1] => [1,0,1,0,1,1,0,0] => 2
[2,2] => [1,1,1,0,0,0] => 3
[2,1,1] => [1,0,1,1,0,1,0,0] => 1
[1,1,1,1] => [1,1,0,1,0,1,0,0] => 1
[5] => [1,0,1,0,1,0,1,0,1,0] => 1
[4,1] => [1,0,1,0,1,0,1,1,0,0] => 2
[3,2] => [1,0,1,1,1,0,0,0] => 3
[3,1,1] => [1,0,1,0,1,1,0,1,0,0] => 1
[2,2,1] => [1,1,1,0,0,1,0,0] => 2
[2,1,1,1] => [1,0,1,1,0,1,0,1,0,0] => 1
[1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => 1
[6] => [1,0,1,0,1,0,1,0,1,0,1,0] => 1
[5,1] => [1,0,1,0,1,0,1,0,1,1,0,0] => 2
[4,2] => [1,0,1,0,1,1,1,0,0,0] => 3
[4,1,1] => [1,0,1,0,1,0,1,1,0,1,0,0] => 1
[3,3] => [1,1,1,0,1,0,0,0] => 1
[3,2,1] => [1,0,1,1,1,0,0,1,0,0] => 2
[3,1,1,1] => [1,0,1,0,1,1,0,1,0,1,0,0] => 1
[2,2,2] => [1,1,1,1,0,0,0,0] => 4
[2,2,1,1] => [1,1,1,0,0,1,0,1,0,0] => 2
[2,1,1,1,1] => [1,0,1,1,0,1,0,1,0,1,0,0] => 1
[1,1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,1,0,0] => 1
[5,2] => [1,0,1,0,1,0,1,1,1,0,0,0] => 3
[4,3] => [1,0,1,1,1,0,1,0,0,0] => 1
[4,2,1] => [1,0,1,0,1,1,1,0,0,1,0,0] => 2
[3,3,1] => [1,1,1,0,1,0,0,1,0,0] => 1
[3,2,2] => [1,0,1,1,1,1,0,0,0,0] => 4
[3,2,1,1] => [1,0,1,1,1,0,0,1,0,1,0,0] => 2
[2,2,2,1] => [1,1,1,1,0,0,0,1,0,0] => 3
[2,2,1,1,1] => [1,1,1,0,0,1,0,1,0,1,0,0] => 2
[5,3] => [1,0,1,0,1,1,1,0,1,0,0,0] => 1
[4,4] => [1,1,1,0,1,0,1,0,0,0] => 1
[4,3,1] => [1,0,1,1,1,0,1,0,0,1,0,0] => 1
[4,2,2] => [1,0,1,0,1,1,1,1,0,0,0,0] => 4
[3,3,2] => [1,1,1,0,1,1,0,0,0,0] => 2
[3,3,1,1] => [1,1,1,0,1,0,0,1,0,1,0,0] => 1
[3,2,2,1] => [1,0,1,1,1,1,0,0,0,1,0,0] => 3
[2,2,2,2] => [1,1,1,1,0,1,0,0,0,0] => 1
[2,2,2,1,1] => [1,1,1,1,0,0,0,1,0,1,0,0] => 3
[5,4] => [1,0,1,1,1,0,1,0,1,0,0,0] => 1
[4,4,1] => [1,1,1,0,1,0,1,0,0,1,0,0] => 1
[4,3,2] => [1,0,1,1,1,0,1,1,0,0,0,0] => 2
[3,3,3] => [1,1,1,1,1,0,0,0,0,0] => 5
[3,3,2,1] => [1,1,1,0,1,1,0,0,0,1,0,0] => 2
[3,2,2,2] => [1,0,1,1,1,1,0,1,0,0,0,0] => 1
[2,2,2,2,1] => [1,1,1,1,0,1,0,0,0,1,0,0] => 1
[5,5] => [1,1,1,0,1,0,1,0,1,0,0,0] => 1
[4,4,2] => [1,1,1,0,1,0,1,1,0,0,0,0] => 2
[4,3,3] => [1,0,1,1,1,1,1,0,0,0,0,0] => 5
[3,3,3,1] => [1,1,1,1,1,0,0,0,0,1,0,0] => 4
[3,3,2,2] => [1,1,1,0,1,1,0,1,0,0,0,0] => 1
[2,2,2,2,2] => [1,1,1,1,0,1,0,1,0,0,0,0] => 1
[4,4,3] => [1,1,1,0,1,1,1,0,0,0,0,0] => 3
[3,3,3,2] => [1,1,1,1,1,0,0,1,0,0,0,0] => 2
[4,4,4] => [1,1,1,1,1,0,1,0,0,0,0,0] => 1
[3,3,3,3] => [1,1,1,1,1,1,0,0,0,0,0,0] => 6
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 difference of lower and upper interactions.
An upper interaction in a Dyck path is the occurrence of a factor $0^k 1^k$ with $k \geq 1$ (see St000331The number of upper interactions of a Dyck path.), and a lower interaction is the occurrence of a factor $1^k 0^k$ with $k \geq 1$. In both cases, $1$ denotes an up-step $0$ denotes a a down-step.
An upper interaction in a Dyck path is the occurrence of a factor $0^k 1^k$ with $k \geq 1$ (see St000331The number of upper interactions of a Dyck path.), and a lower interaction is the occurrence of a factor $1^k 0^k$ with $k \geq 1$. In both cases, $1$ denotes an up-step $0$ denotes a a down-step.
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.
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!