Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000875
(load all 2 compositions to match this statistic)
Mapping
St000875: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
0 => 0
1 => 0
00 => 0
01 => 0
10 => 1
11 => 0
000 => 0
001 => 0
010 => 1
011 => 0
100 => 1
101 => 1
110 => 1
111 => 0
0000 => 0
0001 => 0
0010 => 1
0011 => 0
0100 => 1
0101 => 1
0110 => 1
0111 => 0
1000 => 1
1001 => 1
1010 => 2
1011 => 1
1100 => 2
1101 => 1
1110 => 1
1111 => 0
00000 => 0
00001 => 0
00010 => 1
00011 => 0
00100 => 1
00101 => 1
00110 => 1
00111 => 0
01000 => 1
01001 => 1
01010 => 2
01011 => 1
01100 => 2
01101 => 1
01110 => 1
01111 => 0
10000 => 1
10001 => 1
10010 => 1
10011 => 1
Description
The semilength of the longest Dyck word in the Catalan factorisation of a binary word. Every binary word can be written in a unique way as $(\mathcal D 0)^\ell \mathcal D (1 \mathcal D)^m$, where $\mathcal D$ is the set of Dyck words. This is the Catalan factorisation, see [1, sec.9.1.2]. This statistic records the semilength of the longest Dyck word in this factorisation.