Your data matches 4 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000012
Mp00178: Binary words to compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
Mp00030: Dyck paths zeta mapDyck paths
St000012: 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,1,0,1,0,0]
=> 2
10 => [1,2] => [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
11 => [1,1,1] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 3
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,1,0,1,0,0]
=> 2
010 => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> 5
100 => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 4
110 => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 3
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 6
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,1,0,1,0,0]
=> 2
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 4
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 5
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 3
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 7
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 6
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 9
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 4
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 5
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 8
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 7
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 6
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 10
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,1,0,1,0,0]
=> 2
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 4
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> 5
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 5
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> 8
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> 7
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> 9
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 3
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> 7
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> 9
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> 12
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0]
=> 6
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 11
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> 10
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> 14
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,1,0,1,1,0,0,0]
=> 4
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> 6
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> 8
Description
The area of a Dyck path. This is the number of complete squares in the integer lattice which are below the path and above the x-axis. The 'half-squares' directly above the axis do not contribute to this statistic. 1. Dyck paths are bijection with '''area sequences''' $(a_1,\ldots,a_n)$ such that $a_1 = 0, a_{k+1} \leq a_k + 1$. 2. The generating function $\mathbf{D}_n(q) = \sum_{D \in \mathfrak{D}_n} q^{\operatorname{area}(D)}$ satisfy the recurrence $$\mathbf{D}_{n+1}(q) = \sum q^k \mathbf{D}_k(q) \mathbf{D}_{n-k}(q).$$ 3. The area is equidistributed with [[St000005]] and [[St000006]]. Pairs of these statistics play an important role in the theory of $q,t$-Catalan numbers.
Matching statistic: St000378
Mp00178: Binary words to compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
Mp00027: Dyck paths to partitionInteger partitions
St000378: Integer partitions ⟶ ℤResult quality: 75% values known / values provided: 75%distinct values known / distinct values provided: 100%
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
0000101 => [5,2,1] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0,1,0]
=> [7,5,5]
=> ? = 8
0000110 => [5,1,2] => [1,1,1,1,1,0,0,0,0,0,1,0,1,1,0,0]
=> [6,6,5]
=> ? = 7
0000111 => [5,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0]
=> [7,6,5]
=> ? = 9
0001010 => [4,2,2] => [1,1,1,1,0,0,0,0,1,1,0,0,1,1,0,0]
=> [6,6,4,4]
=> ? = 11
0001011 => [4,2,1,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0,1,0]
=> [7,6,4,4]
=> ? = 13
0001101 => [4,1,2,1] => [1,1,1,1,0,0,0,0,1,0,1,1,0,0,1,0]
=> [7,5,5,4]
=> ? = 12
0001111 => [4,1,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4]
=> ? = 14
0010001 => [3,4,1] => [1,1,1,0,0,0,1,1,1,1,0,0,0,0,1,0]
=> [7,3,3,3,3]
=> ? = 9
0011111 => [3,1,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,3]
=> ? = 20
0100001 => [2,5,1] => [1,1,0,0,1,1,1,1,1,0,0,0,0,0,1,0]
=> [7,2,2,2,2,2]
=> ? = 7
0100111 => [2,3,1,1,1] => [1,1,0,0,1,1,1,0,0,0,1,0,1,0,1,0]
=> [7,6,5,2,2,2]
=> ? = 18
0101000 => [2,2,4] => [1,1,0,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [4,4,4,4,2,2]
=> ? = 9
0101001 => [2,2,3,1] => [1,1,0,0,1,1,0,0,1,1,1,0,0,0,1,0]
=> [7,4,4,4,2,2]
=> ? = 15
0101100 => [2,2,1,3] => [1,1,0,0,1,1,0,0,1,0,1,1,1,0,0,0]
=> [5,5,5,4,2,2]
=> ? = 14
0110001 => [2,1,4,1] => [1,1,0,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> [7,3,3,3,3,2]
=> ? = 11
0110011 => [2,1,3,1,1] => [1,1,0,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> [7,6,3,3,3,2]
=> ? = 17
0110100 => [2,1,2,3] => [1,1,0,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> [5,5,5,3,3,2]
=> ? = 13
0111000 => [2,1,1,4] => [1,1,0,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [4,4,4,4,3,2]
=> ? = 10
0111001 => [2,1,1,3,1] => [1,1,0,0,1,0,1,0,1,1,1,0,0,0,1,0]
=> [7,4,4,4,3,2]
=> ? = 16
0111100 => [2,1,1,1,3] => [1,1,0,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [5,5,5,4,3,2]
=> ? = 15
1000001 => [1,6,1] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [7,1,1,1,1,1,1]
=> ? = 4
1000010 => [1,5,2] => [1,0,1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> [6,6,1,1,1,1,1]
=> ? = 6
1000011 => [1,5,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> [7,6,1,1,1,1,1]
=> ? = 8
1000101 => [1,4,2,1] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> [7,5,5,1,1,1,1]
=> ? = 11
1000110 => [1,4,1,2] => [1,0,1,1,1,1,0,0,0,0,1,0,1,1,0,0]
=> [6,6,5,1,1,1,1]
=> ? = 10
1000111 => [1,4,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> [7,6,5,1,1,1,1]
=> ? = 13
1001000 => [1,3,4] => [1,0,1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> [4,4,4,4,1,1,1]
=> ? = 7
1001111 => [1,3,1,1,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,1,1,1]
=> ? = 19
1010000 => [1,2,5] => [1,0,1,1,0,0,1,1,1,1,1,0,0,0,0,0]
=> [3,3,3,3,3,1,1]
=> ? = 5
1010001 => [1,2,4,1] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0,1,0]
=> [7,3,3,3,3,1,1]
=> ? = 10
1010011 => [1,2,3,1,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0,1,0]
=> [7,6,3,3,3,1,1]
=> ? = 16
1010100 => [1,2,2,3] => [1,0,1,1,0,0,1,1,0,0,1,1,1,0,0,0]
=> [5,5,5,3,3,1,1]
=> ? = 12
1011000 => [1,2,1,4] => [1,0,1,1,0,0,1,0,1,1,1,1,0,0,0,0]
=> [4,4,4,4,3,1,1]
=> ? = 9
1011001 => [1,2,1,3,1] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0,1,0]
=> [7,4,4,4,3,1,1]
=> ? = 15
1011100 => [1,2,1,1,3] => [1,0,1,1,0,0,1,0,1,0,1,1,1,0,0,0]
=> [5,5,5,4,3,1,1]
=> ? = 14
1100001 => [1,1,5,1] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0,1,0]
=> [7,2,2,2,2,2,1]
=> ? = 7
1100010 => [1,1,4,2] => [1,0,1,0,1,1,1,1,0,0,0,0,1,1,0,0]
=> [6,6,2,2,2,2,1]
=> ? = 9
1100011 => [1,1,4,1,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> [7,6,2,2,2,2,1]
=> ? = 12
1100111 => [1,1,3,1,1,1] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0,1,0]
=> [7,6,5,2,2,2,1]
=> ? = 18
1101000 => [1,1,2,4] => [1,0,1,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [4,4,4,4,2,2,1]
=> ? = 8
1101001 => [1,1,2,3,1] => [1,0,1,0,1,1,0,0,1,1,1,0,0,0,1,0]
=> [7,4,4,4,2,2,1]
=> ? = 14
1101100 => [1,1,2,1,3] => [1,0,1,0,1,1,0,0,1,0,1,1,1,0,0,0]
=> [5,5,5,4,2,2,1]
=> ? = 13
1110000 => [1,1,1,5] => [1,0,1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> [3,3,3,3,3,2,1]
=> ? = 6
1110001 => [1,1,1,4,1] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> [7,3,3,3,3,2,1]
=> ? = 11
1110011 => [1,1,1,3,1,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> [7,6,3,3,3,2,1]
=> ? = 17
1110100 => [1,1,1,2,3] => [1,0,1,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> [5,5,5,3,3,2,1]
=> ? = 12
1111001 => [1,1,1,1,3,1] => [1,0,1,0,1,0,1,0,1,1,1,0,0,0,1,0]
=> [7,4,4,4,3,2,1]
=> ? = 16
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].
Mp00178: Binary words to compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St000006: Dyck paths ⟶ ℤResult quality: 33% values known / values provided: 33%distinct values known / distinct values provided: 73%
Values
0 => [2] => [1,1,0,0]
=> 0
1 => [1,1] => [1,0,1,0]
=> 1
00 => [3] => [1,1,1,0,0,0]
=> 0
01 => [2,1] => [1,1,0,0,1,0]
=> 2
10 => [1,2] => [1,0,1,1,0,0]
=> 1
11 => [1,1,1] => [1,0,1,0,1,0]
=> 3
000 => [4] => [1,1,1,1,0,0,0,0]
=> 0
001 => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
010 => [2,2] => [1,1,0,0,1,1,0,0]
=> 3
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 5
100 => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 4
110 => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 3
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 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]
=> 2
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 4
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 5
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 3
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 7
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 6
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 9
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 4
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 5
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 8
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 3
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 7
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 6
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 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]
=> 2
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
=> 4
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
=> 5
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> 5
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> 8
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
=> 7
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
=> 9
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
=> 3
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> 7
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
=> 9
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> 12
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
=> 6
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> 11
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> 10
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> 14
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> 4
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> 6
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> 8
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]
=> ? = 2
000010 => [5,2] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> ? = 4
000011 => [5,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 5
000100 => [4,3] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> ? = 6
000101 => [4,2,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> ? = 8
000110 => [4,1,2] => [1,1,1,1,0,0,0,0,1,0,1,1,0,0]
=> ? = 7
000111 => [4,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 9
001000 => [3,4] => [1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> ? = 5
001001 => [3,3,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0]
=> ? = 9
001010 => [3,2,2] => [1,1,1,0,0,0,1,1,0,0,1,1,0,0]
=> ? = 11
001011 => [3,2,1,1] => [1,1,1,0,0,0,1,1,0,0,1,0,1,0]
=> ? = 13
001100 => [3,1,3] => [1,1,1,0,0,0,1,0,1,1,1,0,0,0]
=> ? = 8
001101 => [3,1,2,1] => [1,1,1,0,0,0,1,0,1,1,0,0,1,0]
=> ? = 12
001110 => [3,1,1,2] => [1,1,1,0,0,0,1,0,1,0,1,1,0,0]
=> ? = 11
001111 => [3,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> ? = 14
010000 => [2,5] => [1,1,0,0,1,1,1,1,1,0,0,0,0,0]
=> ? = 3
010001 => [2,4,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0]
=> ? = 7
010010 => [2,3,2] => [1,1,0,0,1,1,1,0,0,0,1,1,0,0]
=> ? = 10
010011 => [2,3,1,1] => [1,1,0,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 12
010100 => [2,2,3] => [1,1,0,0,1,1,0,0,1,1,1,0,0,0]
=> ? = 9
010101 => [2,2,2,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0]
=> ? = 15
010110 => [2,2,1,2] => [1,1,0,0,1,1,0,0,1,0,1,1,0,0]
=> ? = 14
010111 => [2,2,1,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0]
=> ? = 18
011000 => [2,1,4] => [1,1,0,0,1,0,1,1,1,1,0,0,0,0]
=> ? = 6
011001 => [2,1,3,1] => [1,1,0,0,1,0,1,1,1,0,0,0,1,0]
=> ? = 11
011010 => [2,1,2,2] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0]
=> ? = 13
011011 => [2,1,2,1,1] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 17
011100 => [2,1,1,3] => [1,1,0,0,1,0,1,0,1,1,1,0,0,0]
=> ? = 10
011101 => [2,1,1,2,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> ? = 16
011110 => [2,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0]
=> ? = 15
011111 => [2,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 20
100000 => [1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
100001 => [1,5,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0]
=> ? = 4
100010 => [1,4,2] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0]
=> ? = 6
100011 => [1,4,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 8
100100 => [1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0]
=> ? = 7
100101 => [1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0]
=> ? = 11
100110 => [1,3,1,2] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0]
=> ? = 10
100111 => [1,3,1,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0]
=> ? = 13
101000 => [1,2,4] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> ? = 5
101001 => [1,2,3,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0]
=> ? = 10
101010 => [1,2,2,2] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> ? = 12
101011 => [1,2,2,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> ? = 16
101100 => [1,2,1,3] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0]
=> ? = 9
101101 => [1,2,1,2,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> ? = 15
101110 => [1,2,1,1,2] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> ? = 14
101111 => [1,2,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> ? = 19
110000 => [1,1,5] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> ? = 3
110001 => [1,1,4,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> ? = 7
Description
The dinv of a Dyck path. Let $a=(a_1,\ldots,a_n)$ be the area sequence of a Dyck path $D$ (see [[St000012]]). The dinv statistic of $D$ is $$ \operatorname{dinv}(D) = \# \big\{ i < j : a_i-a_j \in \{ 0,1 \} \big\}.$$ Equivalently, $\operatorname{dinv}(D)$ is also equal to the number of boxes in the partition above $D$ whose ''arm length'' is one larger or equal to its ''leg length''. There is a recursive definition of the $(\operatorname{area},\operatorname{dinv})$ pair of statistics, see [2]. Let $a=(0,a_2,\ldots,a_r,0,a_{r+2},\ldots,a_n)$ be the area sequence of the Dyck path $D$ with $a_i > 0$ for $2\leq i\leq r$ (so that the path touches the diagonal for the first time after $r$ steps). Assume that $D$ has $v$ entries where $a_i=0$. Let $D'$ be the path with the area sequence $(0,a_{r+2},\ldots,a_n,a_2-1,a_3-1,\ldots,a_r-1)$, then the statistics are related by $$(\operatorname{area}(D),\operatorname{dinv}(D)) = (\operatorname{area}(D')+r-1,\operatorname{dinv}(D')+v-1).$$
Matching statistic: St001295
Mp00178: Binary words to compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
Mp00030: Dyck paths zeta mapDyck paths
St001295: Dyck paths ⟶ ℤResult quality: 33% values known / values provided: 33%distinct values known / distinct values provided: 73%
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,1,0,1,0,0]
=> 2
10 => [1,2] => [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
11 => [1,1,1] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 3
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,1,0,1,0,0]
=> 2
010 => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> 5
100 => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 4
110 => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 3
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 6
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,1,0,1,0,0]
=> 2
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 4
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 5
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 3
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 7
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 6
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 9
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 4
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 5
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 8
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 7
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 6
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 10
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,1,0,1,0,0]
=> 2
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 4
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> 5
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 5
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> 8
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> 7
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> 9
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 3
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> 7
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> 9
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> 12
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0]
=> 6
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 11
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> 10
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> 14
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,1,0,1,1,0,0,0]
=> 4
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> 6
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> 8
000000 => [7] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 0
000001 => [6,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> ? = 2
000010 => [5,2] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> ? = 4
000011 => [5,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> ? = 5
000100 => [4,3] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 6
000101 => [4,2,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,1,1,0,1,0,1,0,0,0]
=> ? = 8
000110 => [4,1,2] => [1,1,1,1,0,0,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,1,0,1,0,0,0]
=> ? = 7
000111 => [4,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,1,1,1,0,1,0,0,0,0]
=> ? = 9
001000 => [3,4] => [1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 5
001001 => [3,3,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> ? = 9
001010 => [3,2,2] => [1,1,1,0,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,1,0,0,0]
=> ? = 11
001011 => [3,2,1,1] => [1,1,1,0,0,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,1,0,1,0,0,0,0]
=> ? = 13
001100 => [3,1,3] => [1,1,1,0,0,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,0,0]
=> ? = 8
001101 => [3,1,2,1] => [1,1,1,0,0,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,1,0,1,0,0,0,0]
=> ? = 12
001110 => [3,1,1,2] => [1,1,1,0,0,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,1,0,1,0,0,0,0]
=> ? = 11
001111 => [3,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,1,0,1,0,0,0,0,0]
=> ? = 14
010000 => [2,5] => [1,1,0,0,1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 3
010001 => [2,4,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,1,1,0,1,0,1,0,0,0]
=> ? = 7
010010 => [2,3,2] => [1,1,0,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,0,0]
=> ? = 10
010011 => [2,3,1,1] => [1,1,0,0,1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,1,1,1,0,1,0,1,0,0,0,0]
=> ? = 12
010100 => [2,2,3] => [1,1,0,0,1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,1,0,1,0,0,0]
=> ? = 9
010101 => [2,2,2,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,1,0,1,0,1,0,1,0,0,0,0]
=> ? = 15
010110 => [2,2,1,2] => [1,1,0,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,1,0,1,0,1,0,0,0,0]
=> ? = 14
010111 => [2,2,1,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,0,1,0,0,0,0,0]
=> ? = 18
011000 => [2,1,4] => [1,1,0,0,1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,1,0,1,0,0,0]
=> ? = 6
011001 => [2,1,3,1] => [1,1,0,0,1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,1,1,0,1,0,0,0,0]
=> ? = 11
011010 => [2,1,2,2] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,1,0,1,0,0,0,0]
=> ? = 13
011011 => [2,1,2,1,1] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,1,1,0,1,0,0,0,0,0]
=> ? = 17
011100 => [2,1,1,3] => [1,1,0,0,1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,1,1,0,1,0,0,0,0]
=> ? = 10
011101 => [2,1,1,2,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,1,1,1,0,1,0,0,0,0,0]
=> ? = 16
011110 => [2,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,1,1,1,0,1,0,0,0,0,0]
=> ? = 15
011111 => [2,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> ? = 20
100000 => [1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> ? = 1
100001 => [1,5,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,1,1,0,0,0]
=> ? = 4
100010 => [1,4,2] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,1,0,0,0]
=> ? = 6
100011 => [1,4,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,1,1,0,0,0,0]
=> ? = 8
100100 => [1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,0,0]
=> ? = 7
100101 => [1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,1,1,0,0,0,0]
=> ? = 11
100110 => [1,3,1,2] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,1,1,0,0,0,0]
=> ? = 10
100111 => [1,3,1,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,1,1,0,0,0,0,0]
=> ? = 13
101000 => [1,2,4] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,1,0,0,0]
=> ? = 5
101001 => [1,2,3,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,1,0,1,1,0,0,0,0]
=> ? = 10
101010 => [1,2,2,2] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,1,1,0,0,0,0]
=> ? = 12
101011 => [1,2,2,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,1,0,1,1,0,0,0,0,0]
=> ? = 16
101100 => [1,2,1,3] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,1,1,0,0,0,0]
=> ? = 9
101101 => [1,2,1,2,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,1,1,0,1,1,0,0,0,0,0]
=> ? = 15
101110 => [1,2,1,1,2] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,1,1,0,1,1,0,0,0,0,0]
=> ? = 14
101111 => [1,2,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,1,0,0,0,0,0,0]
=> ? = 19
110000 => [1,1,5] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> ? = 3
110001 => [1,1,4,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,1,0,1,1,1,0,0,0,0]
=> ? = 7
Description
Gives the vector space dimension of the homomorphism space between J^2 and J^2.