Identifier
-
Mp00178:
Binary words
—to composition⟶
Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St000493: Set partitions ⟶ ℤ
Values
0 => [2] => [1,1,0,0] => {{1,2}} => 0
1 => [1,1] => [1,0,1,0] => {{1},{2}} => 1
00 => [3] => [1,1,1,0,0,0] => {{1,2,3}} => 0
01 => [2,1] => [1,1,0,0,1,0] => {{1,2},{3}} => 1
10 => [1,2] => [1,0,1,1,0,0] => {{1},{2,3}} => 2
11 => [1,1,1] => [1,0,1,0,1,0] => {{1},{2},{3}} => 3
000 => [4] => [1,1,1,1,0,0,0,0] => {{1,2,3,4}} => 0
001 => [3,1] => [1,1,1,0,0,0,1,0] => {{1,2,3},{4}} => 1
010 => [2,2] => [1,1,0,0,1,1,0,0] => {{1,2},{3,4}} => 2
011 => [2,1,1] => [1,1,0,0,1,0,1,0] => {{1,2},{3},{4}} => 3
100 => [1,3] => [1,0,1,1,1,0,0,0] => {{1},{2,3,4}} => 3
101 => [1,2,1] => [1,0,1,1,0,0,1,0] => {{1},{2,3},{4}} => 4
110 => [1,1,2] => [1,0,1,0,1,1,0,0] => {{1},{2},{3,4}} => 5
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0] => {{1},{2},{3},{4}} => 6
0000 => [5] => [1,1,1,1,1,0,0,0,0,0] => {{1,2,3,4,5}} => 0
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0] => {{1,2,3,4},{5}} => 1
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0] => {{1,2,3},{4,5}} => 2
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0] => {{1,2,3},{4},{5}} => 3
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0] => {{1,2},{3,4,5}} => 3
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0] => {{1,2},{3,4},{5}} => 4
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0] => {{1,2},{3},{4,5}} => 5
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => {{1,2},{3},{4},{5}} => 6
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0] => {{1},{2,3,4,5}} => 4
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0] => {{1},{2,3,4},{5}} => 5
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0] => {{1},{2,3},{4,5}} => 6
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => {{1},{2,3},{4},{5}} => 7
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0] => {{1},{2},{3,4,5}} => 7
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => {{1},{2},{3,4},{5}} => 8
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => {{1},{2},{3},{4,5}} => 9
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => {{1},{2},{3},{4},{5}} => 10
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0] => {{1,2,3,4,5,6}} => 0
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => {{1,2,3,4,5},{6}} => 1
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => {{1,2,3,4},{5,6}} => 2
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => {{1,2,3,4},{5},{6}} => 3
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => {{1,2,3},{4,5,6}} => 3
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => {{1,2,3},{4,5},{6}} => 4
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => {{1,2,3},{4},{5,6}} => 5
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => {{1,2,3},{4},{5},{6}} => 6
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => {{1,2},{3,4,5,6}} => 4
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => {{1,2},{3,4,5},{6}} => 5
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => {{1,2},{3,4},{5,6}} => 6
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => {{1,2},{3,4},{5},{6}} => 7
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => {{1,2},{3},{4,5,6}} => 7
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => {{1,2},{3},{4,5},{6}} => 8
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => {{1,2},{3},{4},{5,6}} => 9
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0] => {{1,2},{3},{4},{5},{6}} => 10
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => {{1},{2,3,4,5,6}} => 5
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => {{1},{2,3,4,5},{6}} => 6
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => {{1},{2,3,4},{5,6}} => 7
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => {{1},{2,3,4},{5},{6}} => 8
10100 => [1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => {{1},{2,3},{4,5,6}} => 8
10101 => [1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => {{1},{2,3},{4,5},{6}} => 9
10110 => [1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => {{1},{2,3},{4},{5,6}} => 10
10111 => [1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => {{1},{2,3},{4},{5},{6}} => 11
11000 => [1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => {{1},{2},{3,4,5,6}} => 9
11001 => [1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => {{1},{2},{3,4,5},{6}} => 10
11010 => [1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => {{1},{2},{3,4},{5,6}} => 11
11011 => [1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => {{1},{2},{3,4},{5},{6}} => 12
11100 => [1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => {{1},{2},{3},{4,5,6}} => 12
11101 => [1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => {{1},{2},{3},{4,5},{6}} => 13
11110 => [1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => {{1},{2},{3},{4},{5,6}} => 14
11111 => [1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => {{1},{2},{3},{4},{5},{6}} => 15
000000 => [7] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => {{1,2,3,4,5,6,7}} => 0
000001 => [6,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => {{1,2,3,4,5,6},{7}} => 1
000010 => [5,2] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0] => {{1,2,3,4,5},{6,7}} => 2
000011 => [5,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0] => {{1,2,3,4,5},{6},{7}} => 3
000100 => [4,3] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0] => {{1,2,3,4},{5,6,7}} => 3
000101 => [4,2,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0] => {{1,2,3,4},{5,6},{7}} => 4
000110 => [4,1,2] => [1,1,1,1,0,0,0,0,1,0,1,1,0,0] => {{1,2,3,4},{5},{6,7}} => 5
000111 => [4,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0] => {{1,2,3,4},{5},{6},{7}} => 6
001000 => [3,4] => [1,1,1,0,0,0,1,1,1,1,0,0,0,0] => {{1,2,3},{4,5,6,7}} => 4
001001 => [3,3,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0] => {{1,2,3},{4,5,6},{7}} => 5
001010 => [3,2,2] => [1,1,1,0,0,0,1,1,0,0,1,1,0,0] => {{1,2,3},{4,5},{6,7}} => 6
001011 => [3,2,1,1] => [1,1,1,0,0,0,1,1,0,0,1,0,1,0] => {{1,2,3},{4,5},{6},{7}} => 7
001100 => [3,1,3] => [1,1,1,0,0,0,1,0,1,1,1,0,0,0] => {{1,2,3},{4},{5,6,7}} => 7
001101 => [3,1,2,1] => [1,1,1,0,0,0,1,0,1,1,0,0,1,0] => {{1,2,3},{4},{5,6},{7}} => 8
001110 => [3,1,1,2] => [1,1,1,0,0,0,1,0,1,0,1,1,0,0] => {{1,2,3},{4},{5},{6,7}} => 9
001111 => [3,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0] => {{1,2,3},{4},{5},{6},{7}} => 10
010000 => [2,5] => [1,1,0,0,1,1,1,1,1,0,0,0,0,0] => {{1,2},{3,4,5,6,7}} => 5
010001 => [2,4,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0] => {{1,2},{3,4,5,6},{7}} => 6
010010 => [2,3,2] => [1,1,0,0,1,1,1,0,0,0,1,1,0,0] => {{1,2},{3,4,5},{6,7}} => 7
010011 => [2,3,1,1] => [1,1,0,0,1,1,1,0,0,0,1,0,1,0] => {{1,2},{3,4,5},{6},{7}} => 8
010100 => [2,2,3] => [1,1,0,0,1,1,0,0,1,1,1,0,0,0] => {{1,2},{3,4},{5,6,7}} => 8
010101 => [2,2,2,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0] => {{1,2},{3,4},{5,6},{7}} => 9
010110 => [2,2,1,2] => [1,1,0,0,1,1,0,0,1,0,1,1,0,0] => {{1,2},{3,4},{5},{6,7}} => 10
010111 => [2,2,1,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0] => {{1,2},{3,4},{5},{6},{7}} => 11
011000 => [2,1,4] => [1,1,0,0,1,0,1,1,1,1,0,0,0,0] => {{1,2},{3},{4,5,6,7}} => 9
011001 => [2,1,3,1] => [1,1,0,0,1,0,1,1,1,0,0,0,1,0] => {{1,2},{3},{4,5,6},{7}} => 10
011010 => [2,1,2,2] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0] => {{1,2},{3},{4,5},{6,7}} => 11
011011 => [2,1,2,1,1] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0] => {{1,2},{3},{4,5},{6},{7}} => 12
011100 => [2,1,1,3] => [1,1,0,0,1,0,1,0,1,1,1,0,0,0] => {{1,2},{3},{4},{5,6,7}} => 12
011101 => [2,1,1,2,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0] => {{1,2},{3},{4},{5,6},{7}} => 13
011110 => [2,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0] => {{1,2},{3},{4},{5},{6,7}} => 14
011111 => [2,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0] => {{1,2},{3},{4},{5},{6},{7}} => 15
100000 => [1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => {{1},{2,3,4,5,6,7}} => 6
100001 => [1,5,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => {{1},{2,3,4,5,6},{7}} => 7
100010 => [1,4,2] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0] => {{1},{2,3,4,5},{6,7}} => 8
100011 => [1,4,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0] => {{1},{2,3,4,5},{6},{7}} => 9
100100 => [1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0] => {{1},{2,3,4},{5,6,7}} => 9
100101 => [1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0] => {{1},{2,3,4},{5,6},{7}} => 10
100110 => [1,3,1,2] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0] => {{1},{2,3,4},{5},{6,7}} => 11
>>> Load all 133 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 los statistic of a set partition.
Let $S = B_1,\ldots,B_k$ be a set partition with ordered blocks $B_i$ and with $\operatorname{min} B_a < \operatorname{min} B_b$ for $a < b$.
According to [1, Definition 3], a los (left-opener-smaller) of $S$ is given by a pair $i > j$ such that $j = \operatorname{min} B_b$ and $i \in B_a$ for $a > b$.
This is also the dual major index of [2].
Let $S = B_1,\ldots,B_k$ be a set partition with ordered blocks $B_i$ and with $\operatorname{min} B_a < \operatorname{min} B_b$ for $a < b$.
According to [1, Definition 3], a los (left-opener-smaller) of $S$ is given by a pair $i > j$ such that $j = \operatorname{min} B_b$ and $i \in B_a$ for $a > b$.
This is also the dual major index of [2].
Map
to noncrossing partition
Description
Biane's map to noncrossing set partitions.
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!