Identifier
-
Mp00027:
Dyck paths
—to partition⟶
Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St001557: Permutations ⟶ ℤ
Values
[1,0,1,0] => [1] => [1,0,1,0] => [3,1,2] => 0
[1,0,1,0,1,0] => [2,1] => [1,0,1,0,1,0] => [4,1,2,3] => 0
[1,0,1,1,0,0] => [1,1] => [1,0,1,1,0,0] => [3,1,4,2] => 0
[1,1,0,0,1,0] => [2] => [1,1,0,0,1,0] => [2,4,1,3] => 2
[1,1,0,1,0,0] => [1] => [1,0,1,0] => [3,1,2] => 0
[1,0,1,0,1,0,1,0] => [3,2,1] => [1,0,1,0,1,0,1,0] => [5,1,2,3,4] => 0
[1,0,1,0,1,1,0,0] => [2,2,1] => [1,0,1,0,1,1,0,0] => [4,1,2,5,3] => 0
[1,0,1,1,0,0,1,0] => [3,1,1] => [1,0,1,1,0,0,1,0] => [3,1,5,2,4] => 0
[1,0,1,1,0,1,0,0] => [2,1,1] => [1,0,1,1,0,1,0,0] => [5,1,4,2,3] => 0
[1,0,1,1,1,0,0,0] => [1,1,1] => [1,0,1,1,1,0,0,0] => [3,1,4,5,2] => 0
[1,1,0,0,1,0,1,0] => [3,2] => [1,1,0,0,1,0,1,0] => [2,5,1,3,4] => 3
[1,1,0,0,1,1,0,0] => [2,2] => [1,1,0,0,1,1,0,0] => [2,4,1,5,3] => 2
[1,1,0,1,0,0,1,0] => [3,1] => [1,1,0,1,0,0,1,0] => [5,3,1,2,4] => 2
[1,1,0,1,0,1,0,0] => [2,1] => [1,0,1,0,1,0] => [4,1,2,3] => 0
[1,1,0,1,1,0,0,0] => [1,1] => [1,0,1,1,0,0] => [3,1,4,2] => 0
[1,1,1,0,0,0,1,0] => [3] => [1,1,1,0,0,0,1,0] => [2,3,5,1,4] => 1
[1,1,1,0,0,1,0,0] => [2] => [1,1,0,0,1,0] => [2,4,1,3] => 2
[1,1,1,0,1,0,0,0] => [1] => [1,0,1,0] => [3,1,2] => 0
[1,1,0,1,0,1,0,1,0,0] => [3,2,1] => [1,0,1,0,1,0,1,0] => [5,1,2,3,4] => 0
[1,1,0,1,0,1,1,0,0,0] => [2,2,1] => [1,0,1,0,1,1,0,0] => [4,1,2,5,3] => 0
[1,1,0,1,1,0,0,1,0,0] => [3,1,1] => [1,0,1,1,0,0,1,0] => [3,1,5,2,4] => 0
[1,1,0,1,1,0,1,0,0,0] => [2,1,1] => [1,0,1,1,0,1,0,0] => [5,1,4,2,3] => 0
[1,1,0,1,1,1,0,0,0,0] => [1,1,1] => [1,0,1,1,1,0,0,0] => [3,1,4,5,2] => 0
[1,1,1,0,0,1,0,1,0,0] => [3,2] => [1,1,0,0,1,0,1,0] => [2,5,1,3,4] => 3
[1,1,1,0,0,1,1,0,0,0] => [2,2] => [1,1,0,0,1,1,0,0] => [2,4,1,5,3] => 2
[1,1,1,0,1,0,0,1,0,0] => [3,1] => [1,1,0,1,0,0,1,0] => [5,3,1,2,4] => 2
[1,1,1,0,1,0,1,0,0,0] => [2,1] => [1,0,1,0,1,0] => [4,1,2,3] => 0
[1,1,1,0,1,1,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [3,1,4,2] => 0
[1,1,1,1,0,0,0,1,0,0] => [3] => [1,1,1,0,0,0,1,0] => [2,3,5,1,4] => 1
[1,1,1,1,0,0,1,0,0,0] => [2] => [1,1,0,0,1,0] => [2,4,1,3] => 2
[1,1,1,1,0,1,0,0,0,0] => [1] => [1,0,1,0] => [3,1,2] => 0
[1,1,1,0,1,0,1,0,1,0,0,0] => [3,2,1] => [1,0,1,0,1,0,1,0] => [5,1,2,3,4] => 0
[1,1,1,0,1,0,1,1,0,0,0,0] => [2,2,1] => [1,0,1,0,1,1,0,0] => [4,1,2,5,3] => 0
[1,1,1,0,1,1,0,0,1,0,0,0] => [3,1,1] => [1,0,1,1,0,0,1,0] => [3,1,5,2,4] => 0
[1,1,1,0,1,1,0,1,0,0,0,0] => [2,1,1] => [1,0,1,1,0,1,0,0] => [5,1,4,2,3] => 0
[1,1,1,0,1,1,1,0,0,0,0,0] => [1,1,1] => [1,0,1,1,1,0,0,0] => [3,1,4,5,2] => 0
[1,1,1,1,0,0,1,0,1,0,0,0] => [3,2] => [1,1,0,0,1,0,1,0] => [2,5,1,3,4] => 3
[1,1,1,1,0,0,1,1,0,0,0,0] => [2,2] => [1,1,0,0,1,1,0,0] => [2,4,1,5,3] => 2
[1,1,1,1,0,1,0,0,1,0,0,0] => [3,1] => [1,1,0,1,0,0,1,0] => [5,3,1,2,4] => 2
[1,1,1,1,0,1,0,1,0,0,0,0] => [2,1] => [1,0,1,0,1,0] => [4,1,2,3] => 0
[1,1,1,1,0,1,1,0,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [3,1,4,2] => 0
[1,1,1,1,1,0,0,0,1,0,0,0] => [3] => [1,1,1,0,0,0,1,0] => [2,3,5,1,4] => 1
[1,1,1,1,1,0,0,1,0,0,0,0] => [2] => [1,1,0,0,1,0] => [2,4,1,3] => 2
[1,1,1,1,1,0,1,0,0,0,0,0] => [1] => [1,0,1,0] => [3,1,2] => 0
[1,1,1,1,0,1,0,1,0,1,0,0,0,0] => [3,2,1] => [1,0,1,0,1,0,1,0] => [5,1,2,3,4] => 0
[1,1,1,1,0,1,0,1,1,0,0,0,0,0] => [2,2,1] => [1,0,1,0,1,1,0,0] => [4,1,2,5,3] => 0
[1,1,1,1,0,1,1,0,0,1,0,0,0,0] => [3,1,1] => [1,0,1,1,0,0,1,0] => [3,1,5,2,4] => 0
[1,1,1,1,0,1,1,0,1,0,0,0,0,0] => [2,1,1] => [1,0,1,1,0,1,0,0] => [5,1,4,2,3] => 0
[1,1,1,1,0,1,1,1,0,0,0,0,0,0] => [1,1,1] => [1,0,1,1,1,0,0,0] => [3,1,4,5,2] => 0
[1,1,1,1,1,0,0,1,0,1,0,0,0,0] => [3,2] => [1,1,0,0,1,0,1,0] => [2,5,1,3,4] => 3
[1,1,1,1,1,0,0,1,1,0,0,0,0,0] => [2,2] => [1,1,0,0,1,1,0,0] => [2,4,1,5,3] => 2
[1,1,1,1,1,0,1,0,0,1,0,0,0,0] => [3,1] => [1,1,0,1,0,0,1,0] => [5,3,1,2,4] => 2
[1,1,1,1,1,0,1,0,1,0,0,0,0,0] => [2,1] => [1,0,1,0,1,0] => [4,1,2,3] => 0
[1,1,1,1,1,0,1,1,0,0,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [3,1,4,2] => 0
[1,1,1,1,1,1,0,0,0,1,0,0,0,0] => [3] => [1,1,1,0,0,0,1,0] => [2,3,5,1,4] => 1
[1,1,1,1,1,1,0,0,1,0,0,0,0,0] => [2] => [1,1,0,0,1,0] => [2,4,1,3] => 2
[1,1,1,1,1,1,0,1,0,0,0,0,0,0] => [1] => [1,0,1,0] => [3,1,2] => 0
[1,1,1,1,1,0,1,0,1,0,1,0,0,0,0,0] => [3,2,1] => [1,0,1,0,1,0,1,0] => [5,1,2,3,4] => 0
[1,1,1,1,1,0,1,0,1,1,0,0,0,0,0,0] => [2,2,1] => [1,0,1,0,1,1,0,0] => [4,1,2,5,3] => 0
[1,1,1,1,1,0,1,1,0,0,1,0,0,0,0,0] => [3,1,1] => [1,0,1,1,0,0,1,0] => [3,1,5,2,4] => 0
[1,1,1,1,1,0,1,1,0,1,0,0,0,0,0,0] => [2,1,1] => [1,0,1,1,0,1,0,0] => [5,1,4,2,3] => 0
[1,1,1,1,1,0,1,1,1,0,0,0,0,0,0,0] => [1,1,1] => [1,0,1,1,1,0,0,0] => [3,1,4,5,2] => 0
[1,1,1,1,1,1,0,0,1,0,1,0,0,0,0,0] => [3,2] => [1,1,0,0,1,0,1,0] => [2,5,1,3,4] => 3
[1,1,1,1,1,1,0,0,1,1,0,0,0,0,0,0] => [2,2] => [1,1,0,0,1,1,0,0] => [2,4,1,5,3] => 2
[1,1,1,1,1,1,0,1,0,0,1,0,0,0,0,0] => [3,1] => [1,1,0,1,0,0,1,0] => [5,3,1,2,4] => 2
[1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0] => [2,1] => [1,0,1,0,1,0] => [4,1,2,3] => 0
[1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [3,1,4,2] => 0
[1,1,1,1,1,1,1,0,0,0,1,0,0,0,0,0] => [3] => [1,1,1,0,0,0,1,0] => [2,3,5,1,4] => 1
[1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0] => [2] => [1,1,0,0,1,0] => [2,4,1,3] => 2
[1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0] => [1] => [1,0,1,0] => [3,1,2] => 0
[1,1,1,1,1,1,0,1,0,1,0,1,0,0,0,0,0,0] => [3,2,1] => [1,0,1,0,1,0,1,0] => [5,1,2,3,4] => 0
[1,1,1,1,1,1,0,1,0,1,1,0,0,0,0,0,0,0] => [2,2,1] => [1,0,1,0,1,1,0,0] => [4,1,2,5,3] => 0
[1,1,1,1,1,1,0,1,1,0,0,1,0,0,0,0,0,0] => [3,1,1] => [1,0,1,1,0,0,1,0] => [3,1,5,2,4] => 0
[1,1,1,1,1,1,0,1,1,0,1,0,0,0,0,0,0,0] => [2,1,1] => [1,0,1,1,0,1,0,0] => [5,1,4,2,3] => 0
[1,1,1,1,1,1,0,1,1,1,0,0,0,0,0,0,0,0] => [1,1,1] => [1,0,1,1,1,0,0,0] => [3,1,4,5,2] => 0
[1,1,1,1,1,1,1,0,0,1,0,1,0,0,0,0,0,0] => [3,2] => [1,1,0,0,1,0,1,0] => [2,5,1,3,4] => 3
[1,1,1,1,1,1,1,0,0,1,1,0,0,0,0,0,0,0] => [2,2] => [1,1,0,0,1,1,0,0] => [2,4,1,5,3] => 2
[1,1,1,1,1,1,1,0,1,0,0,1,0,0,0,0,0,0] => [3,1] => [1,1,0,1,0,0,1,0] => [5,3,1,2,4] => 2
[1,1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0,0] => [2,1] => [1,0,1,0,1,0] => [4,1,2,3] => 0
[1,1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [3,1,4,2] => 0
[1,1,1,1,1,1,1,1,0,0,0,1,0,0,0,0,0,0] => [3] => [1,1,1,0,0,0,1,0] => [2,3,5,1,4] => 1
[1,1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0,0] => [2] => [1,1,0,0,1,0] => [2,4,1,3] => 2
[1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,0] => [1] => [1,0,1,0] => [3,1,2] => 0
[1,1,1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [3,1,4,2] => 0
[1,1,1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0,0,0] => [2] => [1,1,0,0,1,0] => [2,4,1,3] => 2
[1,1,1,1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [3,1,4,2] => 0
[1,1,1,1,1,1,1,0,1,0,1,1,0,0,0,0,0,0,0,0] => [2,2,1] => [1,0,1,0,1,1,0,0] => [4,1,2,5,3] => 0
[1,1,1,1,1,1,1,1,0,0,1,0,1,0,0,0,0,0,0,0] => [3,2] => [1,1,0,0,1,0,1,0] => [2,5,1,3,4] => 3
[1,1,1,1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0,0,0,0] => [2] => [1,1,0,0,1,0] => [2,4,1,3] => 2
[1,1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,0,0] => [1] => [1,0,1,0] => [3,1,2] => 0
[1,1,1,1,1,1,1,0,1,1,1,0,0,0,0,0,0,0,0,0] => [1,1,1] => [1,0,1,1,1,0,0,0] => [3,1,4,5,2] => 0
[1,1,1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,0,0,0] => [1] => [1,0,1,0] => [3,1,2] => 0
[1,1,1,1,1,1,1,1,1,0,0,0,1,0,0,0,0,0,0,0] => [3] => [1,1,1,0,0,0,1,0] => [2,3,5,1,4] => 1
[1,1,1,1,1,1,1,1,0,0,1,1,0,0,0,0,0,0,0,0] => [2,2] => [1,1,0,0,1,1,0,0] => [2,4,1,5,3] => 2
[1,1,1,1,1,1,1,0,1,1,0,1,0,0,0,0,0,0,0,0] => [2,1,1] => [1,0,1,1,0,1,0,0] => [5,1,4,2,3] => 0
[1,1,1,1,1,1,1,1,0,1,0,0,1,0,0,0,0,0,0,0] => [3,1] => [1,1,0,1,0,0,1,0] => [5,3,1,2,4] => 2
[1,1,1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0,0,0] => [2,1] => [1,0,1,0,1,0] => [4,1,2,3] => 0
[1,1,1,1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0,0,0,0] => [2,1] => [1,0,1,0,1,0] => [4,1,2,3] => 0
[1,1,1,1,1,1,1,0,1,0,1,0,1,0,0,0,0,0,0,0] => [3,2,1] => [1,0,1,0,1,0,1,0] => [5,1,2,3,4] => 0
[1,1,1,1,1,1,1,1,1,1,0,0,0,1,0,0,0,0,0,0,0,0] => [3] => [1,1,1,0,0,0,1,0] => [2,3,5,1,4] => 1
[1,1,1,1,1,1,1,1,1,0,1,0,0,1,0,0,0,0,0,0,0,0] => [3,1] => [1,1,0,1,0,0,1,0] => [5,3,1,2,4] => 2
>>> Load all 107 entries. <<<
search for individual values
searching the database for the individual values of this statistic
Description
The number of inversions of the second entry of a permutation.
This is, for a permutation $\pi$ of length $n$,
$$\# \{2 < k \leq n \mid \pi(2) > \pi(k)\}.$$
The number of inversions of the first entry is St000054The first entry of the permutation. and the number of inversions of the third entry is St001556The number of inversions of the third entry of a permutation.. The sequence of inversions of all the entries define the Lehmer code of a permutation.
This is, for a permutation $\pi$ of length $n$,
$$\# \{2 < k \leq n \mid \pi(2) > \pi(k)\}.$$
The number of inversions of the first entry is St000054The first entry of the permutation. and the number of inversions of the third entry is St001556The number of inversions of the third entry of a permutation.. The sequence of inversions of all the entries define the Lehmer code of a permutation.
Map
Ringel
Description
The Ringel permutation of the LNakayama algebra corresponding to a Dyck path.
Map
to partition
Description
The cut-out partition of a Dyck path.
The partition $\lambda$ associated to a Dyck path is defined to be the complementary partition inside the staircase partition $(n-1,\ldots,2,1)$ when cutting out $D$ considered as a path from $(0,0)$ to $(n,n)$.
In other words, $\lambda_{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,\ldots,2,1)$.
The partition $\lambda$ associated to a Dyck path is defined to be the complementary partition inside the staircase partition $(n-1,\ldots,2,1)$ when cutting out $D$ considered as a path from $(0,0)$ to $(n,n)$.
In other words, $\lambda_{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,\ldots,2,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!