Identifier
-
Mp00027:
Dyck paths
—to partition⟶
Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St001208: Permutations ⟶ ℤ
Values
[1,0,1,0] => [1] => [1,0,1,0] => [1,2] => 1
[1,0,1,0,1,0] => [2,1] => [1,0,1,0,1,0] => [1,2,3] => 1
[1,0,1,1,0,0] => [1,1] => [1,0,1,1,0,0] => [1,3,2] => 1
[1,1,0,0,1,0] => [2] => [1,1,0,0,1,0] => [2,1,3] => 1
[1,1,0,1,0,0] => [1] => [1,0,1,0] => [1,2] => 1
[1,0,1,0,1,0,1,0] => [3,2,1] => [1,0,1,0,1,0,1,0] => [1,2,3,4] => 1
[1,0,1,0,1,1,0,0] => [2,2,1] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => 1
[1,0,1,1,0,0,1,0] => [3,1,1] => [1,0,1,1,0,0,1,0] => [1,3,2,4] => 1
[1,0,1,1,0,1,0,0] => [2,1,1] => [1,0,1,1,0,1,0,0] => [1,3,4,2] => 1
[1,0,1,1,1,0,0,0] => [1,1,1] => [1,0,1,1,1,0,0,0] => [1,4,2,3] => 1
[1,1,0,0,1,0,1,0] => [3,2] => [1,1,0,0,1,0,1,0] => [2,1,3,4] => 1
[1,1,0,0,1,1,0,0] => [2,2] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => 2
[1,1,0,1,0,0,1,0] => [3,1] => [1,1,0,1,0,0,1,0] => [2,3,1,4] => 1
[1,1,0,1,0,1,0,0] => [2,1] => [1,0,1,0,1,0] => [1,2,3] => 1
[1,1,0,1,1,0,0,0] => [1,1] => [1,0,1,1,0,0] => [1,3,2] => 1
[1,1,1,0,0,0,1,0] => [3] => [1,1,1,0,0,0,1,0] => [3,1,2,4] => 1
[1,1,1,0,0,1,0,0] => [2] => [1,1,0,0,1,0] => [2,1,3] => 1
[1,1,1,0,1,0,0,0] => [1] => [1,0,1,0] => [1,2] => 1
[1,0,1,0,1,0,1,0,1,0] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => 1
[1,0,1,0,1,0,1,1,0,0] => [3,3,2,1] => [1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => 1
[1,0,1,0,1,1,0,0,1,0] => [4,2,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => 1
[1,0,1,0,1,1,0,1,0,0] => [3,2,2,1] => [1,0,1,0,1,1,0,1,0,0] => [1,2,4,5,3] => 1
[1,0,1,0,1,1,1,0,0,0] => [2,2,2,1] => [1,0,1,0,1,1,1,0,0,0] => [1,2,5,3,4] => 1
[1,0,1,1,0,0,1,0,1,0] => [4,3,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => 1
[1,0,1,1,0,0,1,1,0,0] => [3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => 2
[1,0,1,1,0,1,0,0,1,0] => [4,2,1,1] => [1,0,1,1,0,1,0,0,1,0] => [1,3,4,2,5] => 1
[1,0,1,1,0,1,0,1,0,0] => [3,2,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,3,4,5,2] => 1
[1,0,1,1,0,1,1,0,0,0] => [2,2,1,1] => [1,0,1,1,0,1,1,0,0,0] => [1,3,5,2,4] => 1
[1,0,1,1,1,0,0,0,1,0] => [4,1,1,1] => [1,0,1,1,1,0,0,0,1,0] => [1,4,2,3,5] => 1
[1,0,1,1,1,0,0,1,0,0] => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,4,2,5,3] => 1
[1,0,1,1,1,0,1,0,0,0] => [2,1,1,1] => [1,0,1,1,1,0,1,0,0,0] => [1,4,5,2,3] => 1
[1,0,1,1,1,1,0,0,0,0] => [1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => [1,5,2,3,4] => 1
[1,1,0,0,1,0,1,0,1,0] => [4,3,2] => [1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => 1
[1,1,0,0,1,0,1,1,0,0] => [3,3,2] => [1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => 2
[1,1,0,0,1,1,0,0,1,0] => [4,2,2] => [1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => 2
[1,1,0,0,1,1,0,1,0,0] => [3,2,2] => [1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => 2
[1,1,0,0,1,1,1,0,0,0] => [2,2,2] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,3,4] => 2
[1,1,0,1,0,0,1,0,1,0] => [4,3,1] => [1,1,0,1,0,0,1,0,1,0] => [2,3,1,4,5] => 1
[1,1,0,1,0,0,1,1,0,0] => [3,3,1] => [1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => 2
[1,1,0,1,0,1,0,0,1,0] => [4,2,1] => [1,1,0,1,0,1,0,0,1,0] => [2,3,4,1,5] => 1
[1,1,0,1,0,1,0,1,0,0] => [3,2,1] => [1,0,1,0,1,0,1,0] => [1,2,3,4] => 1
[1,1,0,1,0,1,1,0,0,0] => [2,2,1] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => 1
[1,1,0,1,1,0,0,0,1,0] => [4,1,1] => [1,1,0,1,1,0,0,0,1,0] => [2,4,1,3,5] => 1
[1,1,0,1,1,0,0,1,0,0] => [3,1,1] => [1,0,1,1,0,0,1,0] => [1,3,2,4] => 1
[1,1,0,1,1,0,1,0,0,0] => [2,1,1] => [1,0,1,1,0,1,0,0] => [1,3,4,2] => 1
[1,1,0,1,1,1,0,0,0,0] => [1,1,1] => [1,0,1,1,1,0,0,0] => [1,4,2,3] => 1
[1,1,1,0,0,0,1,0,1,0] => [4,3] => [1,1,1,0,0,0,1,0,1,0] => [3,1,2,4,5] => 1
[1,1,1,0,0,0,1,1,0,0] => [3,3] => [1,1,1,0,0,0,1,1,0,0] => [3,1,2,5,4] => 2
[1,1,1,0,0,1,0,0,1,0] => [4,2] => [1,1,1,0,0,1,0,0,1,0] => [3,1,4,2,5] => 1
[1,1,1,0,0,1,0,1,0,0] => [3,2] => [1,1,0,0,1,0,1,0] => [2,1,3,4] => 1
[1,1,1,0,0,1,1,0,0,0] => [2,2] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => 2
[1,1,1,0,1,0,0,0,1,0] => [4,1] => [1,1,1,0,1,0,0,0,1,0] => [3,4,1,2,5] => 1
[1,1,1,0,1,0,0,1,0,0] => [3,1] => [1,1,0,1,0,0,1,0] => [2,3,1,4] => 1
[1,1,1,0,1,0,1,0,0,0] => [2,1] => [1,0,1,0,1,0] => [1,2,3] => 1
[1,1,1,0,1,1,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [1,3,2] => 1
[1,1,1,1,0,0,0,0,1,0] => [4] => [1,1,1,1,0,0,0,0,1,0] => [4,1,2,3,5] => 1
[1,1,1,1,0,0,0,1,0,0] => [3] => [1,1,1,0,0,0,1,0] => [3,1,2,4] => 1
[1,1,1,1,0,0,1,0,0,0] => [2] => [1,1,0,0,1,0] => [2,1,3] => 1
[1,1,1,1,0,1,0,0,0,0] => [1] => [1,0,1,0] => [1,2] => 1
[1,1,0,1,0,1,0,1,0,1,0,0] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => 1
[1,1,0,1,0,1,0,1,1,0,0,0] => [3,3,2,1] => [1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => 1
[1,1,0,1,0,1,1,0,0,1,0,0] => [4,2,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => 1
[1,1,0,1,0,1,1,0,1,0,0,0] => [3,2,2,1] => [1,0,1,0,1,1,0,1,0,0] => [1,2,4,5,3] => 1
[1,1,0,1,0,1,1,1,0,0,0,0] => [2,2,2,1] => [1,0,1,0,1,1,1,0,0,0] => [1,2,5,3,4] => 1
[1,1,0,1,1,0,0,1,0,1,0,0] => [4,3,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => 1
[1,1,0,1,1,0,0,1,1,0,0,0] => [3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => 2
[1,1,0,1,1,0,1,0,0,1,0,0] => [4,2,1,1] => [1,0,1,1,0,1,0,0,1,0] => [1,3,4,2,5] => 1
[1,1,0,1,1,0,1,0,1,0,0,0] => [3,2,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,3,4,5,2] => 1
[1,1,0,1,1,0,1,1,0,0,0,0] => [2,2,1,1] => [1,0,1,1,0,1,1,0,0,0] => [1,3,5,2,4] => 1
[1,1,0,1,1,1,0,0,0,1,0,0] => [4,1,1,1] => [1,0,1,1,1,0,0,0,1,0] => [1,4,2,3,5] => 1
[1,1,0,1,1,1,0,0,1,0,0,0] => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,4,2,5,3] => 1
[1,1,0,1,1,1,0,1,0,0,0,0] => [2,1,1,1] => [1,0,1,1,1,0,1,0,0,0] => [1,4,5,2,3] => 1
[1,1,0,1,1,1,1,0,0,0,0,0] => [1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => [1,5,2,3,4] => 1
[1,1,1,0,0,1,0,1,0,1,0,0] => [4,3,2] => [1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => 1
[1,1,1,0,0,1,0,1,1,0,0,0] => [3,3,2] => [1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => 2
[1,1,1,0,0,1,1,0,0,1,0,0] => [4,2,2] => [1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => 2
[1,1,1,0,0,1,1,0,1,0,0,0] => [3,2,2] => [1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => 2
[1,1,1,0,0,1,1,1,0,0,0,0] => [2,2,2] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,3,4] => 2
[1,1,1,0,1,0,0,1,0,1,0,0] => [4,3,1] => [1,1,0,1,0,0,1,0,1,0] => [2,3,1,4,5] => 1
[1,1,1,0,1,0,0,1,1,0,0,0] => [3,3,1] => [1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => 2
[1,1,1,0,1,0,1,0,0,1,0,0] => [4,2,1] => [1,1,0,1,0,1,0,0,1,0] => [2,3,4,1,5] => 1
[1,1,1,0,1,0,1,0,1,0,0,0] => [3,2,1] => [1,0,1,0,1,0,1,0] => [1,2,3,4] => 1
[1,1,1,0,1,0,1,1,0,0,0,0] => [2,2,1] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => 1
[1,1,1,0,1,1,0,0,0,1,0,0] => [4,1,1] => [1,1,0,1,1,0,0,0,1,0] => [2,4,1,3,5] => 1
[1,1,1,0,1,1,0,0,1,0,0,0] => [3,1,1] => [1,0,1,1,0,0,1,0] => [1,3,2,4] => 1
[1,1,1,0,1,1,0,1,0,0,0,0] => [2,1,1] => [1,0,1,1,0,1,0,0] => [1,3,4,2] => 1
[1,1,1,0,1,1,1,0,0,0,0,0] => [1,1,1] => [1,0,1,1,1,0,0,0] => [1,4,2,3] => 1
[1,1,1,1,0,0,0,1,0,1,0,0] => [4,3] => [1,1,1,0,0,0,1,0,1,0] => [3,1,2,4,5] => 1
[1,1,1,1,0,0,0,1,1,0,0,0] => [3,3] => [1,1,1,0,0,0,1,1,0,0] => [3,1,2,5,4] => 2
[1,1,1,1,0,0,1,0,0,1,0,0] => [4,2] => [1,1,1,0,0,1,0,0,1,0] => [3,1,4,2,5] => 1
[1,1,1,1,0,0,1,0,1,0,0,0] => [3,2] => [1,1,0,0,1,0,1,0] => [2,1,3,4] => 1
[1,1,1,1,0,0,1,1,0,0,0,0] => [2,2] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => 2
[1,1,1,1,0,1,0,0,0,1,0,0] => [4,1] => [1,1,1,0,1,0,0,0,1,0] => [3,4,1,2,5] => 1
[1,1,1,1,0,1,0,0,1,0,0,0] => [3,1] => [1,1,0,1,0,0,1,0] => [2,3,1,4] => 1
[1,1,1,1,0,1,0,1,0,0,0,0] => [2,1] => [1,0,1,0,1,0] => [1,2,3] => 1
[1,1,1,1,0,1,1,0,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [1,3,2] => 1
[1,1,1,1,1,0,0,0,0,1,0,0] => [4] => [1,1,1,1,0,0,0,0,1,0] => [4,1,2,3,5] => 1
[1,1,1,1,1,0,0,0,1,0,0,0] => [3] => [1,1,1,0,0,0,1,0] => [3,1,2,4] => 1
[1,1,1,1,1,0,0,1,0,0,0,0] => [2] => [1,1,0,0,1,0] => [2,1,3] => 1
[1,1,1,1,1,0,1,0,0,0,0,0] => [1] => [1,0,1,0] => [1,2] => 1
[1,1,1,0,1,0,1,0,1,0,1,0,0,0] => [4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => 1
>>> Load all 264 entries. <<<
search for individual values
searching the database for the individual values of this statistic
Description
The number of connected components of the quiver of A/T when T is the 1-tilting module corresponding to the permutation in the Auslander algebra A of K[x]/(xn).
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).
Map
to 321-avoiding permutation (Krattenthaler)
Description
Krattenthaler's bijection to 321-avoiding permutations.
Draw the path of semilength n in an n×n square matrix, starting at the upper left corner, with right and down steps, and staying below the diagonal. Then the permutation matrix is obtained by placing ones into the cells corresponding to the peaks of the path and placing ones into the remaining columns from left to right, such that the row indices of the cells increase.
Draw the path of semilength n in an n×n square matrix, starting at the upper left corner, with right and down steps, and staying below the diagonal. Then the permutation matrix is obtained by placing ones into the cells corresponding to the peaks of the path and placing ones into the remaining columns from left to right, such that the row indices of the cells increase.
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!