Identifier
-
Mp00027:
Dyck paths
—to partition⟶
Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St001292: Dyck paths ⟶ ℤ
Values
[1,0,1,0] => [1] => [1,0] => [1,0] => 0
[1,0,1,0,1,0] => [2,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 0
[1,0,1,1,0,0] => [1,1] => [1,1,0,0] => [1,0,1,0] => 0
[1,1,0,0,1,0] => [2] => [1,0,1,0] => [1,1,0,0] => 0
[1,1,0,1,0,0] => [1] => [1,0] => [1,0] => 0
[1,0,1,0,1,0,1,0] => [3,2,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => 0
[1,0,1,0,1,1,0,0] => [2,2,1] => [1,1,1,0,0,1,0,0] => [1,0,1,1,1,0,0,0] => 0
[1,0,1,1,0,0,1,0] => [3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => 0
[1,0,1,1,0,1,0,0] => [2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,0] => 0
[1,0,1,1,1,0,0,0] => [1,1,1] => [1,1,0,1,0,0] => [1,1,1,0,0,0] => 0
[1,1,0,0,1,0,1,0] => [3,2] => [1,0,1,1,1,0,0,0] => [1,1,0,0,1,0,1,0] => 1
[1,1,0,0,1,1,0,0] => [2,2] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => 0
[1,1,0,1,0,0,1,0] => [3,1] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,0,1,0] => 0
[1,1,0,1,0,1,0,0] => [2,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 0
[1,1,0,1,1,0,0,0] => [1,1] => [1,1,0,0] => [1,0,1,0] => 0
[1,1,1,0,0,0,1,0] => [3] => [1,0,1,0,1,0] => [1,1,0,1,0,0] => 0
[1,1,1,0,0,1,0,0] => [2] => [1,0,1,0] => [1,1,0,0] => 0
[1,1,1,0,1,0,0,0] => [1] => [1,0] => [1,0] => 0
[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] => [1,1,1,0,1,0,0,1,1,0,0,0] => 0
[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,1,0,0,1,0,1,1,1,0,0,0] => 1
[1,0,1,0,1,1,1,0,0,0] => [2,2,2,1] => [1,1,1,1,0,0,0,1,0,0] => [1,0,1,0,1,1,1,0,0,0] => 0
[1,0,1,1,0,0,1,1,0,0] => [3,3,1,1] => [1,1,1,0,1,0,0,1,0,1,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => 0
[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,0,0,1,1,1,1,0,0,0,0] => 0
[1,0,1,1,0,1,1,0,0,0] => [2,2,1,1] => [1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,1,1,0,0,0,0] => 0
[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,1,0,1,0,1,1,1,0,0,0,0] => 0
[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,1,0,1,1,1,0,0,0,0] => 0
[1,0,1,1,1,1,0,0,0,0] => [1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,1,1,1,0,0,0,0] => 0
[1,1,0,0,1,0,1,0,1,0] => [4,3,2] => [1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,1,0,1,0,0,0,1,0] => 0
[1,1,0,0,1,0,1,1,0,0] => [3,3,2] => [1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,1,0,0,0,1,0] => 0
[1,1,0,0,1,1,0,0,1,0] => [4,2,2] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,0,1,0,1,0,1,0] => 2
[1,1,0,0,1,1,0,1,0,0] => [3,2,2] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => 2
[1,1,0,0,1,1,1,0,0,0] => [2,2,2] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => 0
[1,1,0,1,0,0,1,0,1,0] => [4,3,1] => [1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => 0
[1,1,0,1,0,0,1,1,0,0] => [3,3,1] => [1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,0,0] => 0
[1,1,0,1,0,1,0,0,1,0] => [4,2,1] => [1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,1,1,0,0,0] => 0
[1,1,0,1,0,1,0,1,0,0] => [3,2,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => 0
[1,1,0,1,0,1,1,0,0,0] => [2,2,1] => [1,1,1,0,0,1,0,0] => [1,0,1,1,1,0,0,0] => 0
[1,1,0,1,1,0,0,0,1,0] => [4,1,1] => [1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => 0
[1,1,0,1,1,0,0,1,0,0] => [3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => 0
[1,1,0,1,1,0,1,0,0,0] => [2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,0] => 0
[1,1,0,1,1,1,0,0,0,0] => [1,1,1] => [1,1,0,1,0,0] => [1,1,1,0,0,0] => 0
[1,1,1,0,0,0,1,0,1,0] => [4,3] => [1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,0,1,0,0,0] => 0
[1,1,1,0,0,0,1,1,0,0] => [3,3] => [1,1,1,0,1,0,0,0] => [1,1,1,0,1,0,0,0] => 0
[1,1,1,0,0,1,0,0,1,0] => [4,2] => [1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,0,1,0,1,0] => 1
[1,1,1,0,0,1,0,1,0,0] => [3,2] => [1,0,1,1,1,0,0,0] => [1,1,0,0,1,0,1,0] => 1
[1,1,1,0,0,1,1,0,0,0] => [2,2] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => 0
[1,1,1,0,1,0,0,0,1,0] => [4,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => 0
[1,1,1,0,1,0,0,1,0,0] => [3,1] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,0,1,0] => 0
[1,1,1,0,1,0,1,0,0,0] => [2,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 0
[1,1,1,0,1,1,0,0,0,0] => [1,1] => [1,1,0,0] => [1,0,1,0] => 0
[1,1,1,1,0,0,0,0,1,0] => [4] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => 0
[1,1,1,1,0,0,0,1,0,0] => [3] => [1,0,1,0,1,0] => [1,1,0,1,0,0] => 0
[1,1,1,1,0,0,1,0,0,0] => [2] => [1,0,1,0] => [1,1,0,0] => 0
[1,1,1,1,0,1,0,0,0,0] => [1] => [1,0] => [1,0] => 0
[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] => [1,1,1,0,1,0,1,1,0,0,0,0] => 0
[1,0,1,1,0,1,1,1,0,0,0,0] => [2,2,2,1,1] => [1,1,1,1,0,0,0,1,0,1,0,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => 0
[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] => [1,0,1,1,1,1,0,1,0,0,0,0] => 0
[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,1,0,1,1,1,0,1,0,0,0,0] => 0
[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] => [1,1,1,1,0,1,0,0,0,0] => 0
[1,1,0,0,1,0,1,1,1,0,0,0] => [3,3,3,2] => [1,1,1,1,1,0,0,1,0,0,0,0] => [1,0,1,1,1,0,1,0,1,0,0,0] => 0
[1,1,0,0,1,1,0,1,1,0,0,0] => [3,3,2,2] => [1,1,1,0,1,1,0,1,0,0,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => 0
[1,1,0,0,1,1,1,0,1,0,0,0] => [3,2,2,2] => [1,0,1,1,1,1,0,1,0,0,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => 0
[1,1,0,0,1,1,1,1,0,0,0,0] => [2,2,2,2] => [1,1,1,1,0,1,0,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => 0
[1,1,0,1,0,0,1,1,1,0,0,0] => [3,3,3,1] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => 0
[1,1,0,1,0,1,0,1,1,0,0,0] => [3,3,2,1] => [1,1,1,0,1,1,0,0,0,1,0,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => 0
[1,1,0,1,0,1,1,0,1,0,0,0] => [3,2,2,1] => [1,0,1,1,1,1,0,0,0,1,0,0] => [1,1,0,0,1,0,1,1,1,0,0,0] => 1
[1,1,0,1,0,1,1,1,0,0,0,0] => [2,2,2,1] => [1,1,1,1,0,0,0,1,0,0] => [1,0,1,0,1,1,1,0,0,0] => 0
[1,1,0,1,1,0,0,1,1,0,0,0] => [3,3,1,1] => [1,1,1,0,1,0,0,1,0,1,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => 0
[1,1,0,1,1,0,1,0,1,0,0,0] => [3,2,1,1] => [1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => 0
[1,1,0,1,1,0,1,1,0,0,0,0] => [2,2,1,1] => [1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,1,1,0,0,0,0] => 0
[1,1,0,1,1,1,0,0,1,0,0,0] => [3,1,1,1] => [1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => 0
[1,1,0,1,1,1,0,1,0,0,0,0] => [2,1,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,0,0] => 0
[1,1,0,1,1,1,1,0,0,0,0,0] => [1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,1,1,1,0,0,0,0] => 0
[1,1,1,0,0,0,1,0,1,1,0,0] => [4,4,3] => [1,1,1,0,1,1,1,0,0,0,0,0] => [1,1,1,0,1,0,0,0,1,0,1,0] => 1
[1,1,1,0,0,0,1,1,0,1,0,0] => [4,3,3] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => 3
[1,1,1,0,0,0,1,1,1,0,0,0] => [3,3,3] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 0
[1,1,1,0,0,1,0,0,1,1,0,0] => [4,4,2] => [1,1,1,0,1,0,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => 0
[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,1,0,1,1,0,1,0,0,0,1,0] => 0
[1,1,1,0,0,1,0,1,1,0,0,0] => [3,3,2] => [1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,1,0,0,0,1,0] => 0
[1,1,1,0,0,1,1,0,0,1,0,0] => [4,2,2] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,0,1,0,1,0,1,0] => 2
[1,1,1,0,0,1,1,0,1,0,0,0] => [3,2,2] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => 2
[1,1,1,0,0,1,1,1,0,0,0,0] => [2,2,2] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => 0
[1,1,1,0,1,0,0,0,1,1,0,0] => [4,4,1] => [1,1,1,0,1,0,1,0,0,1,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => 0
[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,1,0,1,1,0,1,1,0,0,0,0] => 0
[1,1,1,0,1,0,0,1,1,0,0,0] => [3,3,1] => [1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,0,0] => 0
[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,1,0,1,0,0,1,1,1,0,0,0] => 0
[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,1,0,0,1,1,1,0,0,0] => 0
[1,1,1,0,1,0,1,1,0,0,0,0] => [2,2,1] => [1,1,1,0,0,1,0,0] => [1,0,1,1,1,0,0,0] => 0
[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,1,0,1,0,1,0,1,1,0,0,0] => 0
[1,1,1,0,1,1,0,0,1,0,0,0] => [3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => 0
[1,1,1,0,1,1,0,1,0,0,0,0] => [2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,0] => 0
[1,1,1,0,1,1,1,0,0,0,0,0] => [1,1,1] => [1,1,0,1,0,0] => [1,1,1,0,0,0] => 0
[1,1,1,1,0,0,0,0,1,0,1,0] => [5,4] => [1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => 0
[1,1,1,1,0,0,0,0,1,1,0,0] => [4,4] => [1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => 0
[1,1,1,1,0,0,0,1,0,0,1,0] => [5,3] => [1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => 0
[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,1,0,1,1,0,1,0,0,0] => 0
[1,1,1,1,0,0,0,1,1,0,0,0] => [3,3] => [1,1,1,0,1,0,0,0] => [1,1,1,0,1,0,0,0] => 0
[1,1,1,1,0,0,1,0,0,0,1,0] => [5,2] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0,1,0,1,0] => 1
[1,1,1,1,0,0,1,0,0,1,0,0] => [4,2] => [1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,0,1,0,1,0] => 1
[1,1,1,1,0,0,1,0,1,0,0,0] => [3,2] => [1,0,1,1,1,0,0,0] => [1,1,0,0,1,0,1,0] => 1
[1,1,1,1,0,0,1,1,0,0,0,0] => [2,2] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => 0
>>> Load all 344 entries. <<<
search for individual values
searching the database for the individual values of this statistic
Description
The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path.
Here A is the Nakayama algebra associated to a Dyck path as given in DyckPaths/NakayamaAlgebras.
Here A is the Nakayama algebra associated to a Dyck path as given in DyckPaths/NakayamaAlgebras.
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
Delest-Viennot
Description
Return the Dyck path corresponding to the parallelogram polyomino obtained by applying Delest-Viennot's bijection.
Let D be a Dyck path of semilength n. The parallelogram polyomino γ(D) is defined as follows: let ˜D=d0d1…d2n+1 be the Dyck path obtained by prepending an up step and appending a down step to D. Then, the upper path of γ(D) corresponds to the sequence of steps of ˜D with even indices, and the lower path of γ(D) corresponds to the sequence of steps of ˜D with odd indices.
The Delest-Viennot bijection β returns the parallelogram polyomino, whose column heights are the heights of the peaks of the Dyck path, and the intersection heights between columns are the heights of the valleys of the Dyck path.
This map returns the Dyck path (γ(−1)∘β)(D).
Let D be a Dyck path of semilength n. The parallelogram polyomino γ(D) is defined as follows: let ˜D=d0d1…d2n+1 be the Dyck path obtained by prepending an up step and appending a down step to D. Then, the upper path of γ(D) corresponds to the sequence of steps of ˜D with even indices, and the lower path of γ(D) corresponds to the sequence of steps of ˜D with odd indices.
The Delest-Viennot bijection β returns the parallelogram polyomino, whose column heights are the heights of the peaks of the Dyck path, and the intersection heights between columns are the heights of the valleys of the Dyck path.
This map returns the Dyck path (γ(−1)∘β)(D).
Map
to partition
Description
The cut-out partition of a Dyck path.
The partition λ associated to a Dyck path is defined to be the complementary partition inside the staircase partition (n−1,…,2,1) when cutting out D considered as a path from (0,0) to (n,n).
In other words, λ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,…,2,1).
The partition λ associated to a Dyck path is defined to be the complementary partition inside the staircase partition (n−1,…,2,1) when cutting out D considered as a path from (0,0) to (n,n).
In other words, λ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,…,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!