Identifier
-
Mp00178:
Binary words
—to composition⟶
Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000378: Integer partitions ⟶ ℤ
Values
0 => [2] => [1,1,0,0] => [] => 0
1 => [1,1] => [1,0,1,0] => [1] => 1
00 => [3] => [1,1,1,0,0,0] => [] => 0
01 => [2,1] => [1,1,0,0,1,0] => [2] => 2
10 => [1,2] => [1,0,1,1,0,0] => [1,1] => 1
11 => [1,1,1] => [1,0,1,0,1,0] => [2,1] => 3
000 => [4] => [1,1,1,1,0,0,0,0] => [] => 0
001 => [3,1] => [1,1,1,0,0,0,1,0] => [3] => 2
010 => [2,2] => [1,1,0,0,1,1,0,0] => [2,2] => 3
011 => [2,1,1] => [1,1,0,0,1,0,1,0] => [3,2] => 5
100 => [1,3] => [1,0,1,1,1,0,0,0] => [1,1,1] => 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0] => [3,1,1] => 4
110 => [1,1,2] => [1,0,1,0,1,1,0,0] => [2,2,1] => 3
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0] => [3,2,1] => 6
0000 => [5] => [1,1,1,1,1,0,0,0,0,0] => [] => 0
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0] => [4] => 2
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0] => [3,3] => 4
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [4,3] => 5
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0] => [2,2,2] => 3
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [4,2,2] => 7
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [3,3,2] => 6
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => [4,3,2] => 9
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1] => 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [4,1,1,1] => 4
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [3,3,1,1] => 5
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [4,3,1,1] => 8
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [2,2,2,1] => 3
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [4,2,2,1] => 7
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [3,3,2,1] => 6
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [4,3,2,1] => 10
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0] => [] => 0
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => [5] => 2
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => [4,4] => 4
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => [5,4] => 5
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [3,3,3] => 5
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => [5,3,3] => 8
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => [4,4,3] => 7
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => [5,4,3] => 9
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => [2,2,2,2] => 3
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => [5,2,2,2] => 7
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => [4,4,2,2] => 9
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => [5,4,2,2] => 12
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => [3,3,3,2] => 6
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => [5,3,3,2] => 11
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => [4,4,3,2] => 10
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0] => [5,4,3,2] => 14
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1] => 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [5,1,1,1,1] => 4
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => [4,4,1,1,1] => 6
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => [5,4,1,1,1] => 8
10100 => [1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => [3,3,3,1,1] => 5
10101 => [1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => [5,3,3,1,1] => 10
10110 => [1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => [4,4,3,1,1] => 9
10111 => [1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => [5,4,3,1,1] => 13
11000 => [1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => [2,2,2,2,1] => 3
11001 => [1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => [5,2,2,2,1] => 7
11010 => [1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => [4,4,2,2,1] => 8
11011 => [1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => [5,4,2,2,1] => 12
11100 => [1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => [3,3,3,2,1] => 6
11101 => [1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => [5,3,3,2,1] => 11
11110 => [1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => [4,4,3,2,1] => 10
11111 => [1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => [5,4,3,2,1] => 15
000000 => [7] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [] => 0
000001 => [6,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => [6] => 2
000010 => [5,2] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0] => [5,5] => 4
000011 => [5,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0] => [6,5] => 5
000100 => [4,3] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0] => [4,4,4] => 6
000101 => [4,2,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0] => [6,4,4] => 8
000110 => [4,1,2] => [1,1,1,1,0,0,0,0,1,0,1,1,0,0] => [5,5,4] => 7
000111 => [4,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0] => [6,5,4] => 9
001000 => [3,4] => [1,1,1,0,0,0,1,1,1,1,0,0,0,0] => [3,3,3,3] => 5
001001 => [3,3,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0] => [6,3,3,3] => 9
001010 => [3,2,2] => [1,1,1,0,0,0,1,1,0,0,1,1,0,0] => [5,5,3,3] => 11
001011 => [3,2,1,1] => [1,1,1,0,0,0,1,1,0,0,1,0,1,0] => [6,5,3,3] => 13
001100 => [3,1,3] => [1,1,1,0,0,0,1,0,1,1,1,0,0,0] => [4,4,4,3] => 8
001101 => [3,1,2,1] => [1,1,1,0,0,0,1,0,1,1,0,0,1,0] => [6,4,4,3] => 12
001110 => [3,1,1,2] => [1,1,1,0,0,0,1,0,1,0,1,1,0,0] => [5,5,4,3] => 11
001111 => [3,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0] => [6,5,4,3] => 14
010000 => [2,5] => [1,1,0,0,1,1,1,1,1,0,0,0,0,0] => [2,2,2,2,2] => 3
010001 => [2,4,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0] => [6,2,2,2,2] => 7
010010 => [2,3,2] => [1,1,0,0,1,1,1,0,0,0,1,1,0,0] => [5,5,2,2,2] => 10
010011 => [2,3,1,1] => [1,1,0,0,1,1,1,0,0,0,1,0,1,0] => [6,5,2,2,2] => 12
010100 => [2,2,3] => [1,1,0,0,1,1,0,0,1,1,1,0,0,0] => [4,4,4,2,2] => 9
010101 => [2,2,2,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0] => [6,4,4,2,2] => 15
010110 => [2,2,1,2] => [1,1,0,0,1,1,0,0,1,0,1,1,0,0] => [5,5,4,2,2] => 14
010111 => [2,2,1,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0] => [6,5,4,2,2] => 18
011000 => [2,1,4] => [1,1,0,0,1,0,1,1,1,1,0,0,0,0] => [3,3,3,3,2] => 6
011001 => [2,1,3,1] => [1,1,0,0,1,0,1,1,1,0,0,0,1,0] => [6,3,3,3,2] => 11
011010 => [2,1,2,2] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0] => [5,5,3,3,2] => 13
011011 => [2,1,2,1,1] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0] => [6,5,3,3,2] => 17
011100 => [2,1,1,3] => [1,1,0,0,1,0,1,0,1,1,1,0,0,0] => [4,4,4,3,2] => 10
011101 => [2,1,1,2,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0] => [6,4,4,3,2] => 16
011110 => [2,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0] => [5,5,4,3,2] => 15
011111 => [2,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0] => [6,5,4,3,2] => 20
100000 => [1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,1] => 1
100001 => [1,5,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => [6,1,1,1,1,1] => 4
100010 => [1,4,2] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0] => [5,5,1,1,1,1] => 6
100011 => [1,4,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0] => [6,5,1,1,1,1] => 8
100100 => [1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0] => [4,4,4,1,1,1] => 7
100101 => [1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0] => [6,4,4,1,1,1] => 11
100110 => [1,3,1,2] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0] => [5,5,4,1,1,1] => 10
>>> Load all 177 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 diagonal inversion number of an integer partition.
The dinv of a partition is the number of cells $c$ in the diagram of an integer partition $\lambda$ for which $\operatorname{arm}(c)-\operatorname{leg}(c) \in \{0,1\}$.
See also exercise 3.19 of [2].
This statistic is equidistributed with the length of the partition, see [3].
The dinv of a partition is the number of cells $c$ in the diagram of an integer partition $\lambda$ for which $\operatorname{arm}(c)-\operatorname{leg}(c) \in \{0,1\}$.
See also exercise 3.19 of [2].
This statistic is equidistributed with the length of the partition, see [3].
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
bounce path
Description
The bounce path determined by an integer composition.
Map
to composition
Description
The composition corresponding to a binary word.
Prepending $1$ to a binary word $w$, the $i$-th part of the composition equals $1$ plus the number of zeros after the $i$-th $1$ in $w$.
This map is not surjective, since the empty composition does not have a preimage.
Prepending $1$ to a binary word $w$, the $i$-th part of the composition equals $1$ plus the number of zeros after the $i$-th $1$ in $w$.
This map is not surjective, since the empty composition does not have a preimage.
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!