searching the database
Your data matches 2 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St000391
Mp00158: Binary words —alternating inverse⟶ Binary words
Mp00104: Binary words —reverse⟶ Binary words
Mp00269: Binary words —flag zeros to zeros⟶ Binary words
St000391: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00104: Binary words —reverse⟶ Binary words
Mp00269: Binary words —flag zeros to zeros⟶ Binary words
St000391: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
0 => 0 => 0 => 0 => 0
1 => 1 => 1 => 1 => 1
00 => 01 => 10 => 00 => 0
01 => 00 => 00 => 01 => 2
10 => 11 => 11 => 11 => 3
11 => 10 => 01 => 10 => 1
000 => 010 => 010 => 000 => 0
001 => 011 => 110 => 001 => 3
010 => 000 => 000 => 011 => 5
011 => 001 => 100 => 010 => 2
100 => 110 => 011 => 110 => 3
101 => 111 => 111 => 111 => 6
110 => 100 => 001 => 101 => 4
111 => 101 => 101 => 100 => 1
0000 => 0101 => 1010 => 0000 => 0
0001 => 0100 => 0010 => 0001 => 4
0010 => 0111 => 1110 => 0011 => 7
0011 => 0110 => 0110 => 0010 => 3
0100 => 0001 => 1000 => 0110 => 5
0101 => 0000 => 0000 => 0111 => 9
0110 => 0011 => 1100 => 0101 => 6
0111 => 0010 => 0100 => 0100 => 2
1000 => 1101 => 1011 => 1100 => 3
1001 => 1100 => 0011 => 1101 => 7
1010 => 1111 => 1111 => 1111 => 10
1011 => 1110 => 0111 => 1110 => 6
1100 => 1001 => 1001 => 1010 => 4
1101 => 1000 => 0001 => 1011 => 8
1110 => 1011 => 1101 => 1001 => 5
1111 => 1010 => 0101 => 1000 => 1
00000 => 01010 => 01010 => 00000 => 0
00001 => 01011 => 11010 => 00001 => 5
00010 => 01000 => 00010 => 00011 => 9
00011 => 01001 => 10010 => 00010 => 4
00100 => 01110 => 01110 => 00110 => 7
00101 => 01111 => 11110 => 00111 => 12
00110 => 01100 => 00110 => 00101 => 8
00111 => 01101 => 10110 => 00100 => 3
01000 => 00010 => 01000 => 01100 => 5
01001 => 00011 => 11000 => 01101 => 10
01010 => 00000 => 00000 => 01111 => 14
01011 => 00001 => 10000 => 01110 => 9
01100 => 00110 => 01100 => 01010 => 6
01101 => 00111 => 11100 => 01011 => 11
01110 => 00100 => 00100 => 01001 => 7
01111 => 00101 => 10100 => 01000 => 2
10000 => 11010 => 01011 => 11000 => 3
10001 => 11011 => 11011 => 11001 => 8
10010 => 11000 => 00011 => 11011 => 12
10011 => 11001 => 10011 => 11010 => 7
Description
The sum of the positions of the ones in a binary word.
Matching statistic: St000946
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St000946: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St000946: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
0 => [2] => [1,1,0,0]
=> [1,0,1,0]
=> 0
1 => [1,1] => [1,0,1,0]
=> [1,1,0,0]
=> 1
00 => [3] => [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0
01 => [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
10 => [1,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 3
11 => [1,1,1] => [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 1
000 => [4] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
001 => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 3
010 => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 5
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 2
100 => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 3
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 6
110 => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 4
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1
0000 => [5] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 4
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 7
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 5
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 9
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 6
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 3
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 7
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 10
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 6
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 4
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 8
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 5
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 5
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 9
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 4
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 7
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 12
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 8
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 3
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 5
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> 10
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> 14
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0]
=> 9
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 6
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> 11
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 7
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 2
10000 => [1,5] => [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
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> 8
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> 12
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,1,0,1,0,0]
=> 7
Description
The sum of the skew hook positions in a Dyck path.
A skew hook is an occurrence of a down step followed by two up steps or of an up step followed by a down step.
Write $U_i$ for the $i$-th up step and $D_j$ for the $j$-th down step in the Dyck path. Then the skew hook set is the set $$H = \{j: U_{i−1} U_i D_j \text{ is a skew hook}\} \cup \{i: D_{i−1} D_i U_j\text{ is a skew hook}\}.$$
This statistic is the sum of all elements in $H$.
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!