Your data matches 45 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000983
(load all 5 compositions to match this statistic)
Mapping
St000983: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
0 => 1
1 => 1
00 => 1
01 => 2
10 => 2
11 => 1
000 => 1
001 => 2
010 => 3
011 => 2
100 => 2
101 => 3
110 => 2
111 => 1
0000 => 1
0001 => 2
0010 => 3
0011 => 2
0100 => 3
0101 => 4
0110 => 2
0111 => 2
1000 => 2
1001 => 2
1010 => 4
1011 => 3
1100 => 2
1101 => 3
1110 => 2
1111 => 1
00000 => 1
00001 => 2
00010 => 3
00011 => 2
00100 => 3
00101 => 4
00110 => 2
00111 => 2
01000 => 3
01001 => 3
01010 => 5
01011 => 4
01100 => 2
01101 => 3
01110 => 2
01111 => 2
10000 => 2
10001 => 2
10010 => 3
10011 => 2
Description
The length of the longest alternating subword. This is the length of the longest consecutive subword of the form $010...$ or of the form $101...$.
Matching statistic: St000147
Mapping
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00039: Integer compositions —complement⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
St000147: Integer partitions ⟶ ℤResult quality: 91% ●values known / values provided: 91%●distinct values known / distinct values provided: 100%
Values
0 => [1] => [1] => [1]
 => 1
1 => [1] => [1] => [1]
 => 1
00 => [2] => [1,1] => [1,1]
 => 1
01 => [1,1] => [2] => [2]
 => 2
10 => [1,1] => [2] => [2]
 => 2
11 => [2] => [1,1] => [1,1]
 => 1
000 => [3] => [1,1,1] => [1,1,1]
 => 1
001 => [2,1] => [1,2] => [2,1]
 => 2
010 => [1,1,1] => [3] => [3]
 => 3
011 => [1,2] => [2,1] => [2,1]
 => 2
100 => [1,2] => [2,1] => [2,1]
 => 2
101 => [1,1,1] => [3] => [3]
 => 3
110 => [2,1] => [1,2] => [2,1]
 => 2
111 => [3] => [1,1,1] => [1,1,1]
 => 1
0000 => [4] => [1,1,1,1] => [1,1,1,1]
 => 1
0001 => [3,1] => [1,1,2] => [2,1,1]
 => 2
0010 => [2,1,1] => [1,3] => [3,1]
 => 3
0011 => [2,2] => [1,2,1] => [2,1,1]
 => 2
0100 => [1,1,2] => [3,1] => [3,1]
 => 3
0101 => [1,1,1,1] => [4] => [4]
 => 4
0110 => [1,2,1] => [2,2] => [2,2]
 => 2
0111 => [1,3] => [2,1,1] => [2,1,1]
 => 2
1000 => [1,3] => [2,1,1] => [2,1,1]
 => 2
1001 => [1,2,1] => [2,2] => [2,2]
 => 2
1010 => [1,1,1,1] => [4] => [4]
 => 4
1011 => [1,1,2] => [3,1] => [3,1]
 => 3
1100 => [2,2] => [1,2,1] => [2,1,1]
 => 2
1101 => [2,1,1] => [1,3] => [3,1]
 => 3
1110 => [3,1] => [1,1,2] => [2,1,1]
 => 2
1111 => [4] => [1,1,1,1] => [1,1,1,1]
 => 1
00000 => [5] => [1,1,1,1,1] => [1,1,1,1,1]
 => 1
00001 => [4,1] => [1,1,1,2] => [2,1,1,1]
 => 2
00010 => [3,1,1] => [1,1,3] => [3,1,1]
 => 3
00011 => [3,2] => [1,1,2,1] => [2,1,1,1]
 => 2
00100 => [2,1,2] => [1,3,1] => [3,1,1]
 => 3
00101 => [2,1,1,1] => [1,4] => [4,1]
 => 4
00110 => [2,2,1] => [1,2,2] => [2,2,1]
 => 2
00111 => [2,3] => [1,2,1,1] => [2,1,1,1]
 => 2
01000 => [1,1,3] => [3,1,1] => [3,1,1]
 => 3
01001 => [1,1,2,1] => [3,2] => [3,2]
 => 3
01010 => [1,1,1,1,1] => [5] => [5]
 => 5
01011 => [1,1,1,2] => [4,1] => [4,1]
 => 4
01100 => [1,2,2] => [2,2,1] => [2,2,1]
 => 2
01101 => [1,2,1,1] => [2,3] => [3,2]
 => 3
01110 => [1,3,1] => [2,1,2] => [2,2,1]
 => 2
01111 => [1,4] => [2,1,1,1] => [2,1,1,1]
 => 2
10000 => [1,4] => [2,1,1,1] => [2,1,1,1]
 => 2
10001 => [1,3,1] => [2,1,2] => [2,2,1]
 => 2
10010 => [1,2,1,1] => [2,3] => [3,2]
 => 3
10011 => [1,2,2] => [2,2,1] => [2,2,1]
 => 2
0010000001 => ? => ? => ?
 => ? = 3
0010101101 => ? => ? => ?
 => ? = 6
0010100111 => ? => ? => ?
 => ? = 5
0010011101 => ? => ? => ?
 => ? = 3
0010011011 => ? => ? => ?
 => ? = 3
0001110101 => ? => ? => ?
 => ? = 5
0001101101 => ? => ? => ?
 => ? = 3
0001011011 => ? => ? => ?
 => ? = 4
0000111011 => ? => ? => ?
 => ? = 3
0000010010 => ? => ? => ?
 => ? = 3
0001100000 => ? => ? => ?
 => ? = 2
0001100110 => ? => ? => ?
 => ? = 2
0001111000 => ? => ? => ?
 => ? = 2
0001110010 => ? => ? => ?
 => ? = 3
0001001000 => ? => ? => ?
 => ? = 3
0001001110 => ? => ? => ?
 => ? = 3
0001000010 => ? => ? => ?
 => ? = 3
0001011010 => ? => ? => ?
 => ? = 4
0010101000 => ? => ? => ?
 => ? = 7
0010100100 => ? => ? => ?
 => ? = 5
0010010100 => ? => ? => ?
 => ? = 5
0001010100 => ? => ? => ?
 => ? = 7
0010100000 => ? => ? => ?
 => ? = 5
0010000100 => ? => ? => ?
 => ? = 3
0001100001 => ? => ? => ?
 => ? = 2
0001110100 => ? => ? => ?
 => ? = 4
0010011100 => ? => ? => ?
 => ? = 3
0001011100 => ? => ? => ?
 => ? = 4
0000111100 => ? => ? => ?
 => ? = 2
0001101010 => ? => ? => ?
 => ? = 6
0010011010 => ? => ? => ?
 => ? = 4
0000111010 => ? => ? => ?
 => ? = 4
0010100110 => ? => ? => ?
 => ? = 5
0010010110 => ? => ? => ?
 => ? = 4
0001010110 => ? => ? => ?
 => ? = 6
0000110110 => ? => ? => ?
 => ? = 3
0010000010 => ? => ? => ?
 => ? = 3
0001000011 => ? => ? => ?
 => ? = 3
0010000000 => ? => ? => ?
 => ? = 3
0001111001 => ? => ? => ?
 => ? = 2
0000011010 => ? => ? => ?
 => ? = 4
0000101010 => ? => ? => ?
 => ? = 7
0000100101 => ? => ? => ?
 => ? = 4
0010010001 => ? => ? => ?
 => ? = 3
0010000101 => ? => ? => ?
 => ? = 4
0010010011 => ? => ? => ?
 => ? = 3
0000101011 => ? => ? => ?
 => ? = 6
0001000111 => ? => ? => ?
 => ? = 3
0000100111 => ? => ? => ?
 => ? = 3
0010010010 => ? => ? => ?
 => ? = 3
Description
The largest part of an integer partition.
Matching statistic: St000982
(load all 8 compositions to match this statistic)
Mapping
Mp00104: Binary words —reverse⟶ Binary words
Mp00105: Binary words —complement⟶ Binary words
Mp00158: Binary words —alternating inverse⟶ Binary words
St000982: Binary words ⟶ ℤResult quality: 91% ●values known / values provided: 91%●distinct values known / distinct values provided: 100%
Values
0 => 0 => 1 => 1 => 1
1 => 1 => 0 => 0 => 1
00 => 00 => 11 => 10 => 1
01 => 10 => 01 => 00 => 2
10 => 01 => 10 => 11 => 2
11 => 11 => 00 => 01 => 1
000 => 000 => 111 => 101 => 1
001 => 100 => 011 => 001 => 2
010 => 010 => 101 => 111 => 3
011 => 110 => 001 => 011 => 2
100 => 001 => 110 => 100 => 2
101 => 101 => 010 => 000 => 3
110 => 011 => 100 => 110 => 2
111 => 111 => 000 => 010 => 1
0000 => 0000 => 1111 => 1010 => 1
0001 => 1000 => 0111 => 0010 => 2
0010 => 0100 => 1011 => 1110 => 3
0011 => 1100 => 0011 => 0110 => 2
0100 => 0010 => 1101 => 1000 => 3
0101 => 1010 => 0101 => 0000 => 4
0110 => 0110 => 1001 => 1100 => 2
0111 => 1110 => 0001 => 0100 => 2
1000 => 0001 => 1110 => 1011 => 2
1001 => 1001 => 0110 => 0011 => 2
1010 => 0101 => 1010 => 1111 => 4
1011 => 1101 => 0010 => 0111 => 3
1100 => 0011 => 1100 => 1001 => 2
1101 => 1011 => 0100 => 0001 => 3
1110 => 0111 => 1000 => 1101 => 2
1111 => 1111 => 0000 => 0101 => 1
00000 => 00000 => 11111 => 10101 => 1
00001 => 10000 => 01111 => 00101 => 2
00010 => 01000 => 10111 => 11101 => 3
00011 => 11000 => 00111 => 01101 => 2
00100 => 00100 => 11011 => 10001 => 3
00101 => 10100 => 01011 => 00001 => 4
00110 => 01100 => 10011 => 11001 => 2
00111 => 11100 => 00011 => 01001 => 2
01000 => 00010 => 11101 => 10111 => 3
01001 => 10010 => 01101 => 00111 => 3
01010 => 01010 => 10101 => 11111 => 5
01011 => 11010 => 00101 => 01111 => 4
01100 => 00110 => 11001 => 10011 => 2
01101 => 10110 => 01001 => 00011 => 3
01110 => 01110 => 10001 => 11011 => 2
01111 => 11110 => 00001 => 01011 => 2
10000 => 00001 => 11110 => 10100 => 2
10001 => 10001 => 01110 => 00100 => 2
10010 => 01001 => 10110 => 11100 => 3
10011 => 11001 => 00110 => 01100 => 2
0010101011 => 1101010100 => 0010101011 => 0111111110 => ? = 8
0010100111 => 1110010100 => 0001101011 => 0100111110 => ? = 5
0010011011 => 1101100100 => 0010011011 => 0111001110 => ? = 3
0010010111 => 1110100100 => 0001011011 => 0100001110 => ? = 4
0010001111 => 1111000100 => 0000111011 => 0101101110 => ? = 3
0001110011 => 1100111000 => 0011000111 => 0110010010 => ? = 2
0001101011 => 1101011000 => 0010100111 => 0111110010 => ? = 5
0001100111 => 1110011000 => 0001100111 => 0100110010 => ? = 2
0001011011 => 1101101000 => 0010010111 => 0111000010 => ? = 4
0001001111 => 1111001000 => 0000110111 => 0101100010 => ? = 3
0000111011 => 1101110000 => 0010001111 => 0111011010 => ? = 3
0000110111 => 1110110000 => 0001001111 => 0100011010 => ? = 3
0000101111 => 1111010000 => 0000101111 => 0101111010 => ? = 4
0000011111 => 1111100000 => 0000011111 => 0101001010 => ? = 2
0001001000 => 0001001000 => ? => ? => ? = 3
0010100100 => 0010010100 => ? => ? => ? = 5
0010010100 => 0010100100 => ? => ? => ? = 5
0010000100 => 0010000100 => ? => ? => ? = 3
0000000010 => 0100000000 => 1011111111 => 1110101010 => ? = 3
0000001110 => 0111000000 => 1000111111 => 1101101010 => ? = 2
0000111110 => 0111110000 => 1000001111 => 1101011010 => ? = 2
0000000100 => 0010000000 => 1101111111 => 1000101010 => ? = 3
0000001010 => 0101000000 => 1010111111 => 1111101010 => ? = 5
0000010110 => 0110100000 => 1001011111 => 1100001010 => ? = 4
0000101110 => 0111010000 => 1000101111 => 1101111010 => ? = 4
0001011110 => 0111101000 => 1000010111 => 1101000010 => ? = 4
0001101110 => 0111011000 => 1000100111 => 1101110010 => ? = 3
0001111010 => 0101111000 => 1010000111 => 1111010010 => ? = 4
0001111100 => 0011111000 => 1100000111 => 1001010010 => ? = 2
0001100001 => 1000011000 => 0111100111 => 0010110010 => ? = 2
0001110100 => 0010111000 => 1101000111 => 1000010010 => ? = 4
0001101100 => 0011011000 => 1100100111 => 1001110010 => ? = 3
0001011100 => 0011101000 => 1100010111 => 1001000010 => ? = 4
0001101010 => 0101011000 => 1010100111 => 1111110010 => ? = 6
0010011010 => 0101100100 => 1010011011 => 1111001110 => ? = 4
0000111010 => 0101110000 => 1010001111 => 1111011010 => ? = 4
0010100110 => 0110010100 => 1001101011 => 1100111110 => ? = 5
0010010110 => 0110100100 => 1001011011 => 1100001110 => ? = 4
0001010110 => 0110101000 => 1001010111 => 1100000010 => ? = 6
0000110110 => 0110110000 => 1001001111 => 1100011010 => ? = 3
0010001110 => 0111000100 => 1000111011 => 1101101110 => ? = 3
0000011001 => 1001100000 => 0110011111 => 0011001010 => ? = 2
0000110011 => 1100110000 => ? => ? => ? = 2
0000110100 => 0010110000 => 1101001111 => 1000011010 => ? = 4
0010000010 => 0100000100 => 1011111011 => 1110101110 => ? = 3
0001000011 => 1100001000 => 0011110111 => 0110100010 => ? = 3
0001010000 => 0000101000 => 1111010111 => 1010000010 => ? = 5
0001000100 => 0010001000 => 1101110111 => 1000100010 => ? = 3
0001110111 => 1110111000 => 0001000111 => 0100010010 => ? = 3
0010000000 => 0000000100 => 1111111011 => 1010101110 => ? = 3
Description
The length of the longest constant subword.
Matching statistic: St000381
(load all 10 compositions to match this statistic)
Mapping
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00041: Integer compositions —conjugate⟶ Integer compositions
Mp00315: Integer compositions —inverse Foata bijection⟶ Integer compositions
St000381: Integer compositions ⟶ ℤResult quality: 86% ●values known / values provided: 86%●distinct values known / distinct values provided: 100%
Values
0 => [1] => [1] => [1] => 1
1 => [1] => [1] => [1] => 1
00 => [2] => [1,1] => [1,1] => 1
01 => [1,1] => [2] => [2] => 2
10 => [1,1] => [2] => [2] => 2
11 => [2] => [1,1] => [1,1] => 1
000 => [3] => [1,1,1] => [1,1,1] => 1
001 => [2,1] => [2,1] => [2,1] => 2
010 => [1,1,1] => [3] => [3] => 3
011 => [1,2] => [1,2] => [1,2] => 2
100 => [1,2] => [1,2] => [1,2] => 2
101 => [1,1,1] => [3] => [3] => 3
110 => [2,1] => [2,1] => [2,1] => 2
111 => [3] => [1,1,1] => [1,1,1] => 1
0000 => [4] => [1,1,1,1] => [1,1,1,1] => 1
0001 => [3,1] => [2,1,1] => [1,2,1] => 2
0010 => [2,1,1] => [3,1] => [3,1] => 3
0011 => [2,2] => [1,2,1] => [2,1,1] => 2
0100 => [1,1,2] => [1,3] => [1,3] => 3
0101 => [1,1,1,1] => [4] => [4] => 4
0110 => [1,2,1] => [2,2] => [2,2] => 2
0111 => [1,3] => [1,1,2] => [1,1,2] => 2
1000 => [1,3] => [1,1,2] => [1,1,2] => 2
1001 => [1,2,1] => [2,2] => [2,2] => 2
1010 => [1,1,1,1] => [4] => [4] => 4
1011 => [1,1,2] => [1,3] => [1,3] => 3
1100 => [2,2] => [1,2,1] => [2,1,1] => 2
1101 => [2,1,1] => [3,1] => [3,1] => 3
1110 => [3,1] => [2,1,1] => [1,2,1] => 2
1111 => [4] => [1,1,1,1] => [1,1,1,1] => 1
00000 => [5] => [1,1,1,1,1] => [1,1,1,1,1] => 1
00001 => [4,1] => [2,1,1,1] => [1,1,2,1] => 2
00010 => [3,1,1] => [3,1,1] => [1,3,1] => 3
00011 => [3,2] => [1,2,1,1] => [1,2,1,1] => 2
00100 => [2,1,2] => [1,3,1] => [3,1,1] => 3
00101 => [2,1,1,1] => [4,1] => [4,1] => 4
00110 => [2,2,1] => [2,2,1] => [2,2,1] => 2
00111 => [2,3] => [1,1,2,1] => [2,1,1,1] => 2
01000 => [1,1,3] => [1,1,3] => [1,1,3] => 3
01001 => [1,1,2,1] => [2,3] => [2,3] => 3
01010 => [1,1,1,1,1] => [5] => [5] => 5
01011 => [1,1,1,2] => [1,4] => [1,4] => 4
01100 => [1,2,2] => [1,2,2] => [1,2,2] => 2
01101 => [1,2,1,1] => [3,2] => [3,2] => 3
01110 => [1,3,1] => [2,1,2] => [2,1,2] => 2
01111 => [1,4] => [1,1,1,2] => [1,1,1,2] => 2
10000 => [1,4] => [1,1,1,2] => [1,1,1,2] => 2
10001 => [1,3,1] => [2,1,2] => [2,1,2] => 2
10010 => [1,2,1,1] => [3,2] => [3,2] => 3
10011 => [1,2,2] => [1,2,2] => [1,2,2] => 2
0000000001 => [9,1] => [2,1,1,1,1,1,1,1,1] => [1,1,1,1,1,1,1,2,1] => ? = 2
0010000001 => ? => ? => ? => ? = 3
0010101101 => ? => ? => ? => ? = 6
0010100111 => ? => ? => ? => ? = 5
0010011101 => ? => ? => ? => ? = 3
0010011011 => ? => ? => ? => ? = 3
0010010111 => [2,1,2,1,1,3] => [1,1,4,3,1] => [4,3,1,1,1] => ? = 4
0010001111 => [2,1,3,4] => [1,1,1,2,1,3,1] => [1,2,3,1,1,1,1] => ? = 3
0001110101 => ? => ? => ? => ? = 5
0001110011 => [3,3,2,2] => [1,2,2,1,2,1,1] => [1,2,2,1,2,1,1] => ? = 2
0001101101 => ? => ? => ? => ? = 3
0001101011 => [3,2,1,1,1,2] => [1,5,2,1,1] => [1,5,2,1,1] => ? = 5
0001100111 => [3,2,2,3] => [1,1,2,2,2,1,1] => [2,2,1,2,1,1,1] => ? = 2
0001011101 => [3,1,1,3,1,1] => [3,1,4,1,1] => [3,1,1,4,1] => ? = 4
0001011011 => ? => ? => ? => ? = 4
0001010111 => [3,1,1,1,1,3] => [1,1,6,1,1] => [1,6,1,1,1] => ? = 6
0001001111 => [3,1,2,4] => [1,1,1,2,3,1,1] => [2,1,3,1,1,1,1] => ? = 3
0000111101 => [4,4,1,1] => [3,1,1,2,1,1,1] => [1,1,3,1,1,2,1] => ? = 3
0000111011 => ? => ? => ? => ? = 3
0000110111 => [4,2,1,3] => [1,1,3,2,1,1,1] => [1,1,3,2,1,1,1] => ? = 3
0000101111 => [4,1,1,4] => [1,1,1,4,1,1,1] => [1,1,4,1,1,1,1] => ? = 4
0000011111 => [5,5] => [1,1,1,1,2,1,1,1,1] => [1,1,1,2,1,1,1,1,1] => ? = 2
0000000110 => [7,2,1] => [2,2,1,1,1,1,1,1] => [1,1,1,1,2,1,2,1] => ? = 2
0000011000 => [5,2,3] => [1,1,2,2,1,1,1,1] => [1,1,2,1,2,1,1,1] => ? = 2
0000011110 => [5,4,1] => [2,1,1,2,1,1,1,1] => [1,1,2,1,1,1,2,1] => ? = 2
0000010010 => ? => ? => ? => ? = 3
0001100000 => ? => ? => ? => ? = 2
0001100110 => ? => ? => ? => ? = 2
0001111000 => ? => ? => ? => ? = 2
0001111110 => [3,6,1] => [2,1,1,1,1,2,1,1] => [2,1,1,1,1,1,2,1] => ? = 2
0001110010 => ? => ? => ? => ? = 3
0001001000 => ? => ? => ? => ? = 3
0001001110 => ? => ? => ? => ? = 3
0001000010 => ? => ? => ? => ? = 3
0001011010 => ? => ? => ? => ? = 4
0010101000 => ? => ? => ? => ? = 7
0010101100 => [2,1,1,1,1,2,2] => [1,2,6,1] => [2,6,1,1] => ? = 6
0010100100 => ? => ? => ? => ? = 5
0010010100 => ? => ? => ? => ? = 5
0001010100 => ? => ? => ? => ? = 7
0010100000 => ? => ? => ? => ? = 5
0010000100 => ? => ? => ? => ? = 3
0000010100 => [5,1,1,1,2] => [1,5,1,1,1,1] => [1,1,1,5,1,1] => ? = 5
0000000010 => [8,1,1] => [3,1,1,1,1,1,1,1] => [1,1,1,1,1,1,3,1] => ? = 3
0000001110 => [6,3,1] => [2,1,2,1,1,1,1,1] => [1,1,1,2,1,1,2,1] => ? = 2
0000111110 => [4,5,1] => [2,1,1,1,2,1,1,1] => [1,2,1,1,1,1,2,1] => ? = 2
0000000100 => [7,1,2] => [1,3,1,1,1,1,1,1] => [1,1,1,1,1,3,1,1] => ? = 3
0000010110 => [5,1,1,2,1] => [2,4,1,1,1,1] => [1,1,2,1,4,1] => ? = 4
0001011110 => [3,1,1,4,1] => [2,1,1,4,1,1] => [2,1,1,1,4,1] => ? = 4
0001101110 => [3,2,1,3,1] => [2,1,3,2,1,1] => [3,2,1,1,2,1] => ? = 3
Description
The largest part of an integer composition.
Matching statistic: St000013
(load all 2 compositions to match this statistic)
Mapping
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00041: Integer compositions —conjugate⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000013: Dyck paths ⟶ ℤResult quality: 49% ●values known / values provided: 49%●distinct values known / distinct values provided: 100%
Values
0 => [1] => [1] => [1,0]
 => 1
1 => [1] => [1] => [1,0]
 => 1
00 => [2] => [1,1] => [1,0,1,0]
 => 1
01 => [1,1] => [2] => [1,1,0,0]
 => 2
10 => [1,1] => [2] => [1,1,0,0]
 => 2
11 => [2] => [1,1] => [1,0,1,0]
 => 1
000 => [3] => [1,1,1] => [1,0,1,0,1,0]
 => 1
001 => [2,1] => [2,1] => [1,1,0,0,1,0]
 => 2
010 => [1,1,1] => [3] => [1,1,1,0,0,0]
 => 3
011 => [1,2] => [1,2] => [1,0,1,1,0,0]
 => 2
100 => [1,2] => [1,2] => [1,0,1,1,0,0]
 => 2
101 => [1,1,1] => [3] => [1,1,1,0,0,0]
 => 3
110 => [2,1] => [2,1] => [1,1,0,0,1,0]
 => 2
111 => [3] => [1,1,1] => [1,0,1,0,1,0]
 => 1
0000 => [4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 1
0001 => [3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 2
0010 => [2,1,1] => [3,1] => [1,1,1,0,0,0,1,0]
 => 3
0011 => [2,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
0100 => [1,1,2] => [1,3] => [1,0,1,1,1,0,0,0]
 => 3
0101 => [1,1,1,1] => [4] => [1,1,1,1,0,0,0,0]
 => 4
0110 => [1,2,1] => [2,2] => [1,1,0,0,1,1,0,0]
 => 2
0111 => [1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 2
1000 => [1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 2
1001 => [1,2,1] => [2,2] => [1,1,0,0,1,1,0,0]
 => 2
1010 => [1,1,1,1] => [4] => [1,1,1,1,0,0,0,0]
 => 4
1011 => [1,1,2] => [1,3] => [1,0,1,1,1,0,0,0]
 => 3
1100 => [2,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
1101 => [2,1,1] => [3,1] => [1,1,1,0,0,0,1,0]
 => 3
1110 => [3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 2
1111 => [4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 1
00000 => [5] => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 1
00001 => [4,1] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 2
00010 => [3,1,1] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 3
00011 => [3,2] => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 2
00100 => [2,1,2] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 3
00101 => [2,1,1,1] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 4
00110 => [2,2,1] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
00111 => [2,3] => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 2
01000 => [1,1,3] => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => 3
01001 => [1,1,2,1] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 3
01010 => [1,1,1,1,1] => [5] => [1,1,1,1,1,0,0,0,0,0]
 => 5
01011 => [1,1,1,2] => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => 4
01100 => [1,2,2] => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
01101 => [1,2,1,1] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
 => 3
01110 => [1,3,1] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 2
01111 => [1,4] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => 2
10000 => [1,4] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => 2
10001 => [1,3,1] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 2
10010 => [1,2,1,1] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
 => 3
10011 => [1,2,2] => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
00001011 => [4,1,1,2] => [1,4,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0,1,0]
 => ? = 4
00001100 => [4,2,2] => [1,2,2,1,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0,1,0]
 => ? = 2
00001101 => [4,2,1,1] => [3,2,1,1,1] => [1,1,1,0,0,0,1,1,0,0,1,0,1,0,1,0]
 => ? = 3
00001110 => [4,3,1] => [2,1,2,1,1,1] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0,1,0]
 => ? = 2
00010000 => [3,1,4] => [1,1,1,3,1,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0,1,0]
 => ? = 3
00010001 => [3,1,3,1] => [2,1,3,1,1] => [1,1,0,0,1,0,1,1,1,0,0,0,1,0,1,0]
 => ? = 3
00010011 => [3,1,2,2] => [1,2,3,1,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0,1,0]
 => ? = 3
00010111 => [3,1,1,3] => [1,1,4,1,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0,1,0]
 => ? = 4
00011000 => [3,2,3] => [1,1,2,2,1,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0]
 => ? = 2
00011001 => [3,2,2,1] => [2,2,2,1,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0,1,0]
 => ? = 2
00011011 => [3,2,1,2] => [1,3,2,1,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0,1,0]
 => ? = 3
00011100 => [3,3,2] => [1,2,1,2,1,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
 => ? = 2
00011101 => [3,3,1,1] => [3,1,2,1,1] => [1,1,1,0,0,0,1,0,1,1,0,0,1,0,1,0]
 => ? = 3
00100001 => [2,1,4,1] => [2,1,1,3,1] => [1,1,0,0,1,0,1,0,1,1,1,0,0,0,1,0]
 => ? = 3
00100011 => [2,1,3,2] => [1,2,1,3,1] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0,1,0]
 => ? = 3
00100101 => [2,1,2,1,1,1] => [4,3,1] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0,1,0]
 => ? = 4
00100111 => [2,1,2,3] => [1,1,2,3,1] => [1,0,1,0,1,1,0,0,1,1,1,0,0,0,1,0]
 => ? = 3
00101111 => [2,1,1,4] => [1,1,1,4,1] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0,1,0]
 => ? = 4
00110000 => [2,2,4] => [1,1,1,2,2,1] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0,1,0]
 => ? = 2
00110001 => [2,2,3,1] => [2,1,2,2,1] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0,1,0]
 => ? = 2
00110101 => [2,2,1,1,1,1] => [5,2,1] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0,1,0]
 => ? = 5
00110111 => [2,2,1,3] => [1,1,3,2,1] => [1,0,1,0,1,1,1,0,0,0,1,1,0,0,1,0]
 => ? = 3
00111000 => [2,3,3] => [1,1,2,1,2,1] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0,1,0]
 => ? = 2
00111001 => [2,3,2,1] => [2,2,1,2,1] => [1,1,0,0,1,1,0,0,1,0,1,1,0,0,1,0]
 => ? = 2
00111011 => [2,3,1,2] => [1,3,1,2,1] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0,1,0]
 => ? = 3
00111100 => [2,4,2] => [1,2,1,1,2,1] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0]
 => ? = 2
00111101 => [2,4,1,1] => [3,1,1,2,1] => [1,1,1,0,0,0,1,0,1,0,1,1,0,0,1,0]
 => ? = 3
01000011 => [1,1,4,2] => [1,2,1,1,3] => [1,0,1,1,0,0,1,0,1,0,1,1,1,0,0,0]
 => ? = 3
01000101 => [1,1,3,1,1,1] => [4,1,3] => [1,1,1,1,0,0,0,0,1,0,1,1,1,0,0,0]
 => ? = 4
01000111 => [1,1,3,3] => [1,1,2,1,3] => [1,0,1,0,1,1,0,0,1,0,1,1,1,0,0,0]
 => ? = 3
01001001 => [1,1,2,1,2,1] => [2,3,3] => [1,1,0,0,1,1,1,0,0,0,1,1,1,0,0,0]
 => ? = 3
01001011 => [1,1,2,1,1,2] => [1,4,3] => [1,0,1,1,1,1,0,0,0,0,1,1,1,0,0,0]
 => ? = 4
01001101 => [1,1,2,2,1,1] => [3,2,3] => [1,1,1,0,0,0,1,1,0,0,1,1,1,0,0,0]
 => ? = 3
01001111 => [1,1,2,4] => [1,1,1,2,3] => [1,0,1,0,1,0,1,1,0,0,1,1,1,0,0,0]
 => ? = 3
01011101 => [1,1,1,3,1,1] => [3,1,4] => [1,1,1,0,0,0,1,0,1,1,1,1,0,0,0,0]
 => ? = 4
01100001 => [1,2,4,1] => [2,1,1,2,2] => [1,1,0,0,1,0,1,0,1,1,0,0,1,1,0,0]
 => ? = 2
01100011 => [1,2,3,2] => [1,2,1,2,2] => [1,0,1,1,0,0,1,0,1,1,0,0,1,1,0,0]
 => ? = 2
01101101 => [1,2,1,2,1,1] => [3,3,2] => [1,1,1,0,0,0,1,1,1,0,0,0,1,1,0,0]
 => ? = 3
01110001 => [1,3,3,1] => [2,1,2,1,2] => [1,1,0,0,1,0,1,1,0,0,1,0,1,1,0,0]
 => ? = 2
01110011 => [1,3,2,2] => [1,2,2,1,2] => [1,0,1,1,0,0,1,1,0,0,1,0,1,1,0,0]
 => ? = 2
01110101 => [1,3,1,1,1,1] => [5,1,2] => [1,1,1,1,1,0,0,0,0,0,1,0,1,1,0,0]
 => ? = 5
01110111 => [1,3,1,3] => [1,1,3,1,2] => [1,0,1,0,1,1,1,0,0,0,1,0,1,1,0,0]
 => ? = 3
01111001 => [1,4,2,1] => [2,2,1,1,2] => [1,1,0,0,1,1,0,0,1,0,1,0,1,1,0,0]
 => ? = 2
01111011 => [1,4,1,2] => [1,3,1,1,2] => [1,0,1,1,1,0,0,0,1,0,1,0,1,1,0,0]
 => ? = 3
10000100 => [1,4,1,2] => [1,3,1,1,2] => [1,0,1,1,1,0,0,0,1,0,1,0,1,1,0,0]
 => ? = 3
10000110 => [1,4,2,1] => [2,2,1,1,2] => [1,1,0,0,1,1,0,0,1,0,1,0,1,1,0,0]
 => ? = 2
10001000 => [1,3,1,3] => [1,1,3,1,2] => [1,0,1,0,1,1,1,0,0,0,1,0,1,1,0,0]
 => ? = 3
10001010 => [1,3,1,1,1,1] => [5,1,2] => [1,1,1,1,1,0,0,0,0,0,1,0,1,1,0,0]
 => ? = 5
10001100 => [1,3,2,2] => [1,2,2,1,2] => [1,0,1,1,0,0,1,1,0,0,1,0,1,1,0,0]
 => ? = 2
10001110 => [1,3,3,1] => [2,1,2,1,2] => [1,1,0,0,1,0,1,1,0,0,1,0,1,1,0,0]
 => ? = 2
Description
The height of a Dyck path. The height of a Dyck path $D$ of semilength $n$ is defined as the maximal height of a peak of $D$. The height of $D$ at position $i$ is the number of up-steps minus the number of down-steps before position $i$.
Matching statistic: St000444
(load all 3 compositions to match this statistic)
Mapping
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00039: Integer compositions —complement⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000444: Dyck paths ⟶ ℤResult quality: 37% ●values known / values provided: 37%●distinct values known / distinct values provided: 78%
Values
0 => [1] => [1] => [1,0]
 => ? = 1
1 => [1] => [1] => [1,0]
 => ? = 1
00 => [2] => [1,1] => [1,0,1,0]
 => 1
01 => [1,1] => [2] => [1,1,0,0]
 => 2
10 => [1,1] => [2] => [1,1,0,0]
 => 2
11 => [2] => [1,1] => [1,0,1,0]
 => 1
000 => [3] => [1,1,1] => [1,0,1,0,1,0]
 => 1
001 => [2,1] => [1,2] => [1,0,1,1,0,0]
 => 2
010 => [1,1,1] => [3] => [1,1,1,0,0,0]
 => 3
011 => [1,2] => [2,1] => [1,1,0,0,1,0]
 => 2
100 => [1,2] => [2,1] => [1,1,0,0,1,0]
 => 2
101 => [1,1,1] => [3] => [1,1,1,0,0,0]
 => 3
110 => [2,1] => [1,2] => [1,0,1,1,0,0]
 => 2
111 => [3] => [1,1,1] => [1,0,1,0,1,0]
 => 1
0000 => [4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 1
0001 => [3,1] => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 2
0010 => [2,1,1] => [1,3] => [1,0,1,1,1,0,0,0]
 => 3
0011 => [2,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
0100 => [1,1,2] => [3,1] => [1,1,1,0,0,0,1,0]
 => 3
0101 => [1,1,1,1] => [4] => [1,1,1,1,0,0,0,0]
 => 4
0110 => [1,2,1] => [2,2] => [1,1,0,0,1,1,0,0]
 => 2
0111 => [1,3] => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 2
1000 => [1,3] => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 2
1001 => [1,2,1] => [2,2] => [1,1,0,0,1,1,0,0]
 => 2
1010 => [1,1,1,1] => [4] => [1,1,1,1,0,0,0,0]
 => 4
1011 => [1,1,2] => [3,1] => [1,1,1,0,0,0,1,0]
 => 3
1100 => [2,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
1101 => [2,1,1] => [1,3] => [1,0,1,1,1,0,0,0]
 => 3
1110 => [3,1] => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 2
1111 => [4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 1
00000 => [5] => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 1
00001 => [4,1] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => 2
00010 => [3,1,1] => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => 3
00011 => [3,2] => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 2
00100 => [2,1,2] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 3
00101 => [2,1,1,1] => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => 4
00110 => [2,2,1] => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
00111 => [2,3] => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 2
01000 => [1,1,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 3
01001 => [1,1,2,1] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
 => 3
01010 => [1,1,1,1,1] => [5] => [1,1,1,1,1,0,0,0,0,0]
 => 5
01011 => [1,1,1,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 4
01100 => [1,2,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
01101 => [1,2,1,1] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 3
01110 => [1,3,1] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 2
01111 => [1,4] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 2
10000 => [1,4] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 2
10001 => [1,3,1] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 2
10010 => [1,2,1,1] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 3
10011 => [1,2,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
10100 => [1,1,1,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 4
10101 => [1,1,1,1,1] => [5] => [1,1,1,1,1,0,0,0,0,0]
 => 5
01000000 => [1,1,6] => [3,1,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0]
 => ? = 3
01000001 => [1,1,5,1] => [3,1,1,1,2] => [1,1,1,0,0,0,1,0,1,0,1,0,1,1,0,0]
 => ? = 3
01000010 => [1,1,4,1,1] => [3,1,1,3] => [1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0]
 => ? = 3
01000011 => [1,1,4,2] => [3,1,1,2,1] => [1,1,1,0,0,0,1,0,1,0,1,1,0,0,1,0]
 => ? = 3
01000100 => [1,1,3,1,2] => [3,1,3,1] => [1,1,1,0,0,0,1,0,1,1,1,0,0,0,1,0]
 => ? = 3
01000101 => [1,1,3,1,1,1] => [3,1,4] => [1,1,1,0,0,0,1,0,1,1,1,1,0,0,0,0]
 => ? = 4
01000110 => [1,1,3,2,1] => [3,1,2,2] => [1,1,1,0,0,0,1,0,1,1,0,0,1,1,0,0]
 => ? = 3
01000111 => [1,1,3,3] => [3,1,2,1,1] => [1,1,1,0,0,0,1,0,1,1,0,0,1,0,1,0]
 => ? = 3
01001000 => [1,1,2,1,3] => [3,3,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,0]
 => ? = 3
01001001 => [1,1,2,1,2,1] => [3,3,2] => [1,1,1,0,0,0,1,1,1,0,0,0,1,1,0,0]
 => ? = 3
01001010 => [1,1,2,1,1,1,1] => [3,5] => [1,1,1,0,0,0,1,1,1,1,1,0,0,0,0,0]
 => ? = 5
01001011 => [1,1,2,1,1,2] => [3,4,1] => [1,1,1,0,0,0,1,1,1,1,0,0,0,0,1,0]
 => ? = 4
01001100 => [1,1,2,2,2] => [3,2,2,1] => [1,1,1,0,0,0,1,1,0,0,1,1,0,0,1,0]
 => ? = 3
01001101 => [1,1,2,2,1,1] => [3,2,3] => [1,1,1,0,0,0,1,1,0,0,1,1,1,0,0,0]
 => ? = 3
01001110 => [1,1,2,3,1] => [3,2,1,2] => [1,1,1,0,0,0,1,1,0,0,1,0,1,1,0,0]
 => ? = 3
01001111 => [1,1,2,4] => [3,2,1,1,1] => [1,1,1,0,0,0,1,1,0,0,1,0,1,0,1,0]
 => ? = 3
01010000 => [1,1,1,1,4] => [5,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0]
 => ? = 5
01010001 => [1,1,1,1,3,1] => [5,1,2] => [1,1,1,1,1,0,0,0,0,0,1,0,1,1,0,0]
 => ? = 5
01010010 => [1,1,1,1,2,1,1] => [5,3] => [1,1,1,1,1,0,0,0,0,0,1,1,1,0,0,0]
 => ? = 5
01010011 => [1,1,1,1,2,2] => [5,2,1] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0,1,0]
 => ? = 5
01010100 => [1,1,1,1,1,1,2] => [7,1] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
 => ? = 7
01010101 => [1,1,1,1,1,1,1,1] => [8] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
 => ? = 8
01010110 => [1,1,1,1,1,2,1] => [6,2] => [1,1,1,1,1,1,0,0,0,0,0,0,1,1,0,0]
 => ? = 6
01010111 => [1,1,1,1,1,3] => [6,1,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0]
 => ? = 6
01011000 => [1,1,1,2,3] => [4,2,1,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0,1,0]
 => ? = 4
01011001 => [1,1,1,2,2,1] => [4,2,2] => [1,1,1,1,0,0,0,0,1,1,0,0,1,1,0,0]
 => ? = 4
01011010 => [1,1,1,2,1,1,1] => [4,4] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
 => ? = 4
01011011 => [1,1,1,2,1,2] => [4,3,1] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0,1,0]
 => ? = 4
01011100 => [1,1,1,3,2] => [4,1,2,1] => [1,1,1,1,0,0,0,0,1,0,1,1,0,0,1,0]
 => ? = 4
01011101 => [1,1,1,3,1,1] => [4,1,3] => [1,1,1,1,0,0,0,0,1,0,1,1,1,0,0,0]
 => ? = 4
01011110 => [1,1,1,4,1] => [4,1,1,2] => [1,1,1,1,0,0,0,0,1,0,1,0,1,1,0,0]
 => ? = 4
01011111 => [1,1,1,5] => [4,1,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0]
 => ? = 4
10100000 => [1,1,1,5] => [4,1,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0]
 => ? = 4
10100001 => [1,1,1,4,1] => [4,1,1,2] => [1,1,1,1,0,0,0,0,1,0,1,0,1,1,0,0]
 => ? = 4
10100010 => [1,1,1,3,1,1] => [4,1,3] => [1,1,1,1,0,0,0,0,1,0,1,1,1,0,0,0]
 => ? = 4
10100011 => [1,1,1,3,2] => [4,1,2,1] => [1,1,1,1,0,0,0,0,1,0,1,1,0,0,1,0]
 => ? = 4
10100100 => [1,1,1,2,1,2] => [4,3,1] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0,1,0]
 => ? = 4
10100101 => [1,1,1,2,1,1,1] => [4,4] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
 => ? = 4
10100110 => [1,1,1,2,2,1] => [4,2,2] => [1,1,1,1,0,0,0,0,1,1,0,0,1,1,0,0]
 => ? = 4
10100111 => [1,1,1,2,3] => [4,2,1,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0,1,0]
 => ? = 4
10101000 => [1,1,1,1,1,3] => [6,1,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0]
 => ? = 6
10101001 => [1,1,1,1,1,2,1] => [6,2] => [1,1,1,1,1,1,0,0,0,0,0,0,1,1,0,0]
 => ? = 6
10101010 => [1,1,1,1,1,1,1,1] => [8] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
 => ? = 8
10101011 => [1,1,1,1,1,1,2] => [7,1] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
 => ? = 7
10101100 => [1,1,1,1,2,2] => [5,2,1] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0,1,0]
 => ? = 5
10101101 => [1,1,1,1,2,1,1] => [5,3] => [1,1,1,1,1,0,0,0,0,0,1,1,1,0,0,0]
 => ? = 5
10101110 => [1,1,1,1,3,1] => [5,1,2] => [1,1,1,1,1,0,0,0,0,0,1,0,1,1,0,0]
 => ? = 5
10101111 => [1,1,1,1,4] => [5,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0]
 => ? = 5
Description
The length of the maximal rise of a Dyck path.
Matching statistic: St000442
(load all 2 compositions to match this statistic)
Mapping
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00039: Integer compositions —complement⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000442: Dyck paths ⟶ ℤResult quality: 37% ●values known / values provided: 37%●distinct values known / distinct values provided: 78%
Values
0 => [1] => [1] => [1,0]
 => ? = 1 - 1
1 => [1] => [1] => [1,0]
 => ? = 1 - 1
00 => [2] => [1,1] => [1,0,1,0]
 => 0 = 1 - 1
01 => [1,1] => [2] => [1,1,0,0]
 => 1 = 2 - 1
10 => [1,1] => [2] => [1,1,0,0]
 => 1 = 2 - 1
11 => [2] => [1,1] => [1,0,1,0]
 => 0 = 1 - 1
000 => [3] => [1,1,1] => [1,0,1,0,1,0]
 => 0 = 1 - 1
001 => [2,1] => [1,2] => [1,0,1,1,0,0]
 => 1 = 2 - 1
010 => [1,1,1] => [3] => [1,1,1,0,0,0]
 => 2 = 3 - 1
011 => [1,2] => [2,1] => [1,1,0,0,1,0]
 => 1 = 2 - 1
100 => [1,2] => [2,1] => [1,1,0,0,1,0]
 => 1 = 2 - 1
101 => [1,1,1] => [3] => [1,1,1,0,0,0]
 => 2 = 3 - 1
110 => [2,1] => [1,2] => [1,0,1,1,0,0]
 => 1 = 2 - 1
111 => [3] => [1,1,1] => [1,0,1,0,1,0]
 => 0 = 1 - 1
0000 => [4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 0 = 1 - 1
0001 => [3,1] => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 1 = 2 - 1
0010 => [2,1,1] => [1,3] => [1,0,1,1,1,0,0,0]
 => 2 = 3 - 1
0011 => [2,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 1 = 2 - 1
0100 => [1,1,2] => [3,1] => [1,1,1,0,0,0,1,0]
 => 2 = 3 - 1
0101 => [1,1,1,1] => [4] => [1,1,1,1,0,0,0,0]
 => 3 = 4 - 1
0110 => [1,2,1] => [2,2] => [1,1,0,0,1,1,0,0]
 => 1 = 2 - 1
0111 => [1,3] => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 1 = 2 - 1
1000 => [1,3] => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 1 = 2 - 1
1001 => [1,2,1] => [2,2] => [1,1,0,0,1,1,0,0]
 => 1 = 2 - 1
1010 => [1,1,1,1] => [4] => [1,1,1,1,0,0,0,0]
 => 3 = 4 - 1
1011 => [1,1,2] => [3,1] => [1,1,1,0,0,0,1,0]
 => 2 = 3 - 1
1100 => [2,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 1 = 2 - 1
1101 => [2,1,1] => [1,3] => [1,0,1,1,1,0,0,0]
 => 2 = 3 - 1
1110 => [3,1] => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 1 = 2 - 1
1111 => [4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 0 = 1 - 1
00000 => [5] => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 0 = 1 - 1
00001 => [4,1] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => 1 = 2 - 1
00010 => [3,1,1] => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => 2 = 3 - 1
00011 => [3,2] => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 1 = 2 - 1
00100 => [2,1,2] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2 = 3 - 1
00101 => [2,1,1,1] => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => 3 = 4 - 1
00110 => [2,2,1] => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 1 = 2 - 1
00111 => [2,3] => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 1 = 2 - 1
01000 => [1,1,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 2 = 3 - 1
01001 => [1,1,2,1] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
 => 2 = 3 - 1
01010 => [1,1,1,1,1] => [5] => [1,1,1,1,1,0,0,0,0,0]
 => 4 = 5 - 1
01011 => [1,1,1,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 3 = 4 - 1
01100 => [1,2,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 1 = 2 - 1
01101 => [1,2,1,1] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 2 = 3 - 1
01110 => [1,3,1] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 1 = 2 - 1
01111 => [1,4] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 1 = 2 - 1
10000 => [1,4] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 1 = 2 - 1
10001 => [1,3,1] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 1 = 2 - 1
10010 => [1,2,1,1] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 2 = 3 - 1
10011 => [1,2,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 1 = 2 - 1
10100 => [1,1,1,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 3 = 4 - 1
10101 => [1,1,1,1,1] => [5] => [1,1,1,1,1,0,0,0,0,0]
 => 4 = 5 - 1
01000000 => [1,1,6] => [3,1,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0]
 => ? = 3 - 1
01000001 => [1,1,5,1] => [3,1,1,1,2] => [1,1,1,0,0,0,1,0,1,0,1,0,1,1,0,0]
 => ? = 3 - 1
01000010 => [1,1,4,1,1] => [3,1,1,3] => [1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0]
 => ? = 3 - 1
01000011 => [1,1,4,2] => [3,1,1,2,1] => [1,1,1,0,0,0,1,0,1,0,1,1,0,0,1,0]
 => ? = 3 - 1
01000100 => [1,1,3,1,2] => [3,1,3,1] => [1,1,1,0,0,0,1,0,1,1,1,0,0,0,1,0]
 => ? = 3 - 1
01000101 => [1,1,3,1,1,1] => [3,1,4] => [1,1,1,0,0,0,1,0,1,1,1,1,0,0,0,0]
 => ? = 4 - 1
01000110 => [1,1,3,2,1] => [3,1,2,2] => [1,1,1,0,0,0,1,0,1,1,0,0,1,1,0,0]
 => ? = 3 - 1
01000111 => [1,1,3,3] => [3,1,2,1,1] => [1,1,1,0,0,0,1,0,1,1,0,0,1,0,1,0]
 => ? = 3 - 1
01001000 => [1,1,2,1,3] => [3,3,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,0]
 => ? = 3 - 1
01001001 => [1,1,2,1,2,1] => [3,3,2] => [1,1,1,0,0,0,1,1,1,0,0,0,1,1,0,0]
 => ? = 3 - 1
01001010 => [1,1,2,1,1,1,1] => [3,5] => [1,1,1,0,0,0,1,1,1,1,1,0,0,0,0,0]
 => ? = 5 - 1
01001011 => [1,1,2,1,1,2] => [3,4,1] => [1,1,1,0,0,0,1,1,1,1,0,0,0,0,1,0]
 => ? = 4 - 1
01001100 => [1,1,2,2,2] => [3,2,2,1] => [1,1,1,0,0,0,1,1,0,0,1,1,0,0,1,0]
 => ? = 3 - 1
01001101 => [1,1,2,2,1,1] => [3,2,3] => [1,1,1,0,0,0,1,1,0,0,1,1,1,0,0,0]
 => ? = 3 - 1
01001110 => [1,1,2,3,1] => [3,2,1,2] => [1,1,1,0,0,0,1,1,0,0,1,0,1,1,0,0]
 => ? = 3 - 1
01001111 => [1,1,2,4] => [3,2,1,1,1] => [1,1,1,0,0,0,1,1,0,0,1,0,1,0,1,0]
 => ? = 3 - 1
01010000 => [1,1,1,1,4] => [5,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0]
 => ? = 5 - 1
01010001 => [1,1,1,1,3,1] => [5,1,2] => [1,1,1,1,1,0,0,0,0,0,1,0,1,1,0,0]
 => ? = 5 - 1
01010010 => [1,1,1,1,2,1,1] => [5,3] => [1,1,1,1,1,0,0,0,0,0,1,1,1,0,0,0]
 => ? = 5 - 1
01010011 => [1,1,1,1,2,2] => [5,2,1] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0,1,0]
 => ? = 5 - 1
01010100 => [1,1,1,1,1,1,2] => [7,1] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
 => ? = 7 - 1
01010101 => [1,1,1,1,1,1,1,1] => [8] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
 => ? = 8 - 1
01010110 => [1,1,1,1,1,2,1] => [6,2] => [1,1,1,1,1,1,0,0,0,0,0,0,1,1,0,0]
 => ? = 6 - 1
01010111 => [1,1,1,1,1,3] => [6,1,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0]
 => ? = 6 - 1
01011000 => [1,1,1,2,3] => [4,2,1,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0,1,0]
 => ? = 4 - 1
01011001 => [1,1,1,2,2,1] => [4,2,2] => [1,1,1,1,0,0,0,0,1,1,0,0,1,1,0,0]
 => ? = 4 - 1
01011010 => [1,1,1,2,1,1,1] => [4,4] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
 => ? = 4 - 1
01011011 => [1,1,1,2,1,2] => [4,3,1] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0,1,0]
 => ? = 4 - 1
01011100 => [1,1,1,3,2] => [4,1,2,1] => [1,1,1,1,0,0,0,0,1,0,1,1,0,0,1,0]
 => ? = 4 - 1
01011101 => [1,1,1,3,1,1] => [4,1,3] => [1,1,1,1,0,0,0,0,1,0,1,1,1,0,0,0]
 => ? = 4 - 1
01011110 => [1,1,1,4,1] => [4,1,1,2] => [1,1,1,1,0,0,0,0,1,0,1,0,1,1,0,0]
 => ? = 4 - 1
01011111 => [1,1,1,5] => [4,1,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0]
 => ? = 4 - 1
10100000 => [1,1,1,5] => [4,1,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0]
 => ? = 4 - 1
10100001 => [1,1,1,4,1] => [4,1,1,2] => [1,1,1,1,0,0,0,0,1,0,1,0,1,1,0,0]
 => ? = 4 - 1
10100010 => [1,1,1,3,1,1] => [4,1,3] => [1,1,1,1,0,0,0,0,1,0,1,1,1,0,0,0]
 => ? = 4 - 1
10100011 => [1,1,1,3,2] => [4,1,2,1] => [1,1,1,1,0,0,0,0,1,0,1,1,0,0,1,0]
 => ? = 4 - 1
10100100 => [1,1,1,2,1,2] => [4,3,1] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0,1,0]
 => ? = 4 - 1
10100101 => [1,1,1,2,1,1,1] => [4,4] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
 => ? = 4 - 1
10100110 => [1,1,1,2,2,1] => [4,2,2] => [1,1,1,1,0,0,0,0,1,1,0,0,1,1,0,0]
 => ? = 4 - 1
10100111 => [1,1,1,2,3] => [4,2,1,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0,1,0]
 => ? = 4 - 1
10101000 => [1,1,1,1,1,3] => [6,1,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0]
 => ? = 6 - 1
10101001 => [1,1,1,1,1,2,1] => [6,2] => [1,1,1,1,1,1,0,0,0,0,0,0,1,1,0,0]
 => ? = 6 - 1
10101010 => [1,1,1,1,1,1,1,1] => [8] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
 => ? = 8 - 1
10101011 => [1,1,1,1,1,1,2] => [7,1] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
 => ? = 7 - 1
10101100 => [1,1,1,1,2,2] => [5,2,1] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0,1,0]
 => ? = 5 - 1
10101101 => [1,1,1,1,2,1,1] => [5,3] => [1,1,1,1,1,0,0,0,0,0,1,1,1,0,0,0]
 => ? = 5 - 1
10101110 => [1,1,1,1,3,1] => [5,1,2] => [1,1,1,1,1,0,0,0,0,0,1,0,1,1,0,0]
 => ? = 5 - 1
10101111 => [1,1,1,1,4] => [5,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0]
 => ? = 5 - 1
Description
The maximal area to the right of an up step of a Dyck path.
Matching statistic: St000684
(load all 2 compositions to match this statistic)
Mapping
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000684: Dyck paths ⟶ ℤResult quality: 24% ●values known / values provided: 24%●distinct values known / distinct values provided: 89%
Values
0 => [1] => [1,0]
 => 1
1 => [1] => [1,0]
 => 1
00 => [2] => [1,1,0,0]
 => 1
01 => [1,1] => [1,0,1,0]
 => 2
10 => [1,1] => [1,0,1,0]
 => 2
11 => [2] => [1,1,0,0]
 => 1
000 => [3] => [1,1,1,0,0,0]
 => 1
001 => [2,1] => [1,1,0,0,1,0]
 => 2
010 => [1,1,1] => [1,0,1,0,1,0]
 => 3
011 => [1,2] => [1,0,1,1,0,0]
 => 2
100 => [1,2] => [1,0,1,1,0,0]
 => 2
101 => [1,1,1] => [1,0,1,0,1,0]
 => 3
110 => [2,1] => [1,1,0,0,1,0]
 => 2
111 => [3] => [1,1,1,0,0,0]
 => 1
0000 => [4] => [1,1,1,1,0,0,0,0]
 => 1
0001 => [3,1] => [1,1,1,0,0,0,1,0]
 => 2
0010 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 3
0011 => [2,2] => [1,1,0,0,1,1,0,0]
 => 2
0100 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 3
0101 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 4
0110 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
0111 => [1,3] => [1,0,1,1,1,0,0,0]
 => 2
1000 => [1,3] => [1,0,1,1,1,0,0,0]
 => 2
1001 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
1010 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 4
1011 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 3
1100 => [2,2] => [1,1,0,0,1,1,0,0]
 => 2
1101 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 3
1110 => [3,1] => [1,1,1,0,0,0,1,0]
 => 2
1111 => [4] => [1,1,1,1,0,0,0,0]
 => 1
00000 => [5] => [1,1,1,1,1,0,0,0,0,0]
 => 1
00001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 2
00010 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 3
00011 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
 => 2
00100 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 3
00101 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 4
00110 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
00111 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 2
01000 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => 3
01001 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 3
01010 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 5
01011 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => 4
01100 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
01101 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 3
01110 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
01111 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => 2
10000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => 2
10001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
10010 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 3
10011 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
00000000 => [8] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
 => ? = 1
00000001 => [7,1] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
 => ? = 2
00000010 => [6,1,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0]
 => ? = 3
00000011 => [6,2] => [1,1,1,1,1,1,0,0,0,0,0,0,1,1,0,0]
 => ? = 2
00000100 => [5,1,2] => [1,1,1,1,1,0,0,0,0,0,1,0,1,1,0,0]
 => ? = 3
00000101 => [5,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0]
 => ? = 4
00000110 => [5,2,1] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0,1,0]
 => ? = 2
00000111 => [5,3] => [1,1,1,1,1,0,0,0,0,0,1,1,1,0,0,0]
 => ? = 2
00001000 => [4,1,3] => [1,1,1,1,0,0,0,0,1,0,1,1,1,0,0,0]
 => ? = 3
00001001 => [4,1,2,1] => [1,1,1,1,0,0,0,0,1,0,1,1,0,0,1,0]
 => ? = 3
00001011 => [4,1,1,2] => [1,1,1,1,0,0,0,0,1,0,1,0,1,1,0,0]
 => ? = 4
00001100 => [4,2,2] => [1,1,1,1,0,0,0,0,1,1,0,0,1,1,0,0]
 => ? = 2
00001101 => [4,2,1,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0,1,0]
 => ? = 3
00001110 => [4,3,1] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0,1,0]
 => ? = 2
00001111 => [4,4] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
 => ? = 2
00010000 => [3,1,4] => [1,1,1,0,0,0,1,0,1,1,1,1,0,0,0,0]
 => ? = 3
00010001 => [3,1,3,1] => [1,1,1,0,0,0,1,0,1,1,1,0,0,0,1,0]
 => ? = 3
00010010 => [3,1,2,1,1] => [1,1,1,0,0,0,1,0,1,1,0,0,1,0,1,0]
 => ? = 3
00010011 => [3,1,2,2] => [1,1,1,0,0,0,1,0,1,1,0,0,1,1,0,0]
 => ? = 3
00010110 => [3,1,1,2,1] => [1,1,1,0,0,0,1,0,1,0,1,1,0,0,1,0]
 => ? = 4
00010111 => [3,1,1,3] => [1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0]
 => ? = 4
00011000 => [3,2,3] => [1,1,1,0,0,0,1,1,0,0,1,1,1,0,0,0]
 => ? = 2
00011001 => [3,2,2,1] => [1,1,1,0,0,0,1,1,0,0,1,1,0,0,1,0]
 => ? = 2
00011010 => [3,2,1,1,1] => [1,1,1,0,0,0,1,1,0,0,1,0,1,0,1,0]
 => ? = 4
00011011 => [3,2,1,2] => [1,1,1,0,0,0,1,1,0,0,1,0,1,1,0,0]
 => ? = 3
00011100 => [3,3,2] => [1,1,1,0,0,0,1,1,1,0,0,0,1,1,0,0]
 => ? = 2
00011101 => [3,3,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,0]
 => ? = 3
00011110 => [3,4,1] => [1,1,1,0,0,0,1,1,1,1,0,0,0,0,1,0]
 => ? = 2
00011111 => [3,5] => [1,1,1,0,0,0,1,1,1,1,1,0,0,0,0,0]
 => ? = 2
00100000 => [2,1,5] => [1,1,0,0,1,0,1,1,1,1,1,0,0,0,0,0]
 => ? = 3
00100001 => [2,1,4,1] => [1,1,0,0,1,0,1,1,1,1,0,0,0,0,1,0]
 => ? = 3
00100010 => [2,1,3,1,1] => [1,1,0,0,1,0,1,1,1,0,0,0,1,0,1,0]
 => ? = 3
00100011 => [2,1,3,2] => [1,1,0,0,1,0,1,1,1,0,0,0,1,1,0,0]
 => ? = 3
00100100 => [2,1,2,1,2] => [1,1,0,0,1,0,1,1,0,0,1,0,1,1,0,0]
 => ? = 3
00100101 => [2,1,2,1,1,1] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0,1,0]
 => ? = 4
00100110 => [2,1,2,2,1] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0,1,0]
 => ? = 3
00100111 => [2,1,2,3] => [1,1,0,0,1,0,1,1,0,0,1,1,1,0,0,0]
 => ? = 3
00101100 => [2,1,1,2,2] => [1,1,0,0,1,0,1,0,1,1,0,0,1,1,0,0]
 => ? = 4
00101101 => [2,1,1,2,1,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0]
 => ? = 4
00101110 => [2,1,1,3,1] => [1,1,0,0,1,0,1,0,1,1,1,0,0,0,1,0]
 => ? = 4
00101111 => [2,1,1,4] => [1,1,0,0,1,0,1,0,1,1,1,1,0,0,0,0]
 => ? = 4
00110000 => [2,2,4] => [1,1,0,0,1,1,0,0,1,1,1,1,0,0,0,0]
 => ? = 2
00110001 => [2,2,3,1] => [1,1,0,0,1,1,0,0,1,1,1,0,0,0,1,0]
 => ? = 2
00110010 => [2,2,2,1,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0,1,0]
 => ? = 3
00110011 => [2,2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => ? = 2
00110100 => [2,2,1,1,2] => [1,1,0,0,1,1,0,0,1,0,1,0,1,1,0,0]
 => ? = 4
00110110 => [2,2,1,2,1] => [1,1,0,0,1,1,0,0,1,0,1,1,0,0,1,0]
 => ? = 3
00110111 => [2,2,1,3] => [1,1,0,0,1,1,0,0,1,0,1,1,1,0,0,0]
 => ? = 3
00111000 => [2,3,3] => [1,1,0,0,1,1,1,0,0,0,1,1,1,0,0,0]
 => ? = 2
00111001 => [2,3,2,1] => [1,1,0,0,1,1,1,0,0,0,1,1,0,0,1,0]
 => ? = 2
Description
The global dimension of the LNakayama algebra associated to a Dyck path. An n-LNakayama algebra is a quiver algebra with a directed line as a connected quiver with $n$ points for $n \geq 2$. Number those points from the left to the right by $0,1,\ldots,n-1$. The algebra is then uniquely determined by the dimension $c_i$ of the projective indecomposable modules at point $i$. Such algebras are then uniquely determined by lists of the form $[c_0,c_1,...,c_{n-1}]$ with the conditions: $c_{n-1}=1$ and $c_i -1 \leq c_{i+1}$ for all $i$. The number of such algebras is then the $n-1$-st Catalan number $C_{n-1}$. One can get also an interpretation with Dyck paths by associating the top boundary of the Auslander-Reiten quiver (which is a Dyck path) to those algebras. Example: [3,4,3,3,2,1] corresponds to the Dyck path [1,1,0,1,1,0,0,1,0,0]. Conjecture: that there is an explicit bijection between $n$-LNakayama algebras with global dimension bounded by $m$ and Dyck paths with height at most $m$. Examples: * For $m=2$, the number of Dyck paths with global dimension at most $m$ starts for $n \geq 2$ with 1,2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192. * For $m=3$, the number of Dyck paths with global dimension at most $m$ starts for $n \geq 2$ with 1, 2, 5, 13, 34, 89, 233, 610, 1597, 4181, 10946, 28657, 75025, 196418.
Matching statistic: St001090
Mapping
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
St001090: Permutations ⟶ ℤResult quality: 22% ●values known / values provided: 22%●distinct values known / distinct values provided: 100%
Values
0 => [1] => [1,0]
 => [1] => 0 = 1 - 1
1 => [1] => [1,0]
 => [1] => 0 = 1 - 1
00 => [2] => [1,1,0,0]
 => [1,2] => 0 = 1 - 1
01 => [1,1] => [1,0,1,0]
 => [2,1] => 1 = 2 - 1
10 => [1,1] => [1,0,1,0]
 => [2,1] => 1 = 2 - 1
11 => [2] => [1,1,0,0]
 => [1,2] => 0 = 1 - 1
000 => [3] => [1,1,1,0,0,0]
 => [1,2,3] => 0 = 1 - 1
001 => [2,1] => [1,1,0,0,1,0]
 => [1,3,2] => 1 = 2 - 1
010 => [1,1,1] => [1,0,1,0,1,0]
 => [2,3,1] => 2 = 3 - 1
011 => [1,2] => [1,0,1,1,0,0]
 => [2,1,3] => 1 = 2 - 1
100 => [1,2] => [1,0,1,1,0,0]
 => [2,1,3] => 1 = 2 - 1
101 => [1,1,1] => [1,0,1,0,1,0]
 => [2,3,1] => 2 = 3 - 1
110 => [2,1] => [1,1,0,0,1,0]
 => [1,3,2] => 1 = 2 - 1
111 => [3] => [1,1,1,0,0,0]
 => [1,2,3] => 0 = 1 - 1
0000 => [4] => [1,1,1,1,0,0,0,0]
 => [1,2,3,4] => 0 = 1 - 1
0001 => [3,1] => [1,1,1,0,0,0,1,0]
 => [1,2,4,3] => 1 = 2 - 1
0010 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => [1,3,4,2] => 2 = 3 - 1
0011 => [2,2] => [1,1,0,0,1,1,0,0]
 => [1,3,2,4] => 1 = 2 - 1
0100 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => [2,3,1,4] => 2 = 3 - 1
0101 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => [2,3,4,1] => 3 = 4 - 1
0110 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => [2,1,4,3] => 1 = 2 - 1
0111 => [1,3] => [1,0,1,1,1,0,0,0]
 => [2,1,3,4] => 1 = 2 - 1
1000 => [1,3] => [1,0,1,1,1,0,0,0]
 => [2,1,3,4] => 1 = 2 - 1
1001 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => [2,1,4,3] => 1 = 2 - 1
1010 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => [2,3,4,1] => 3 = 4 - 1
1011 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => [2,3,1,4] => 2 = 3 - 1
1100 => [2,2] => [1,1,0,0,1,1,0,0]
 => [1,3,2,4] => 1 = 2 - 1
1101 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => [1,3,4,2] => 2 = 3 - 1
1110 => [3,1] => [1,1,1,0,0,0,1,0]
 => [1,2,4,3] => 1 = 2 - 1
1111 => [4] => [1,1,1,1,0,0,0,0]
 => [1,2,3,4] => 0 = 1 - 1
00000 => [5] => [1,1,1,1,1,0,0,0,0,0]
 => [1,2,3,4,5] => 0 = 1 - 1
00001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => [1,2,3,5,4] => 1 = 2 - 1
00010 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => [1,2,4,5,3] => 2 = 3 - 1
00011 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
 => [1,2,4,3,5] => 1 = 2 - 1
00100 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => [1,3,4,2,5] => 2 = 3 - 1
00101 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => [1,3,4,5,2] => 3 = 4 - 1
00110 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => [1,3,2,5,4] => 1 = 2 - 1
00111 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => [1,3,2,4,5] => 1 = 2 - 1
01000 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => [2,3,1,4,5] => 2 = 3 - 1
01001 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => [2,3,1,5,4] => 2 = 3 - 1
01010 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => [2,3,4,5,1] => 4 = 5 - 1
01011 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => [2,3,4,1,5] => 3 = 4 - 1
01100 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => [2,1,4,3,5] => 1 = 2 - 1
01101 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => [2,1,4,5,3] => 2 = 3 - 1
01110 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => [2,1,3,5,4] => 1 = 2 - 1
01111 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => [2,1,3,4,5] => 1 = 2 - 1
10000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => [2,1,3,4,5] => 1 = 2 - 1
10001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => [2,1,3,5,4] => 1 = 2 - 1
10010 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => [2,1,4,5,3] => 2 = 3 - 1
10011 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => [2,1,4,3,5] => 1 = 2 - 1
0100001 => [1,1,4,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0]
 => [2,3,1,4,5,7,6] => ? = 3 - 1
0100010 => [1,1,3,1,1] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0]
 => [2,3,1,4,6,7,5] => ? = 3 - 1
0100011 => [1,1,3,2] => [1,0,1,0,1,1,1,0,0,0,1,1,0,0]
 => [2,3,1,4,6,5,7] => ? = 3 - 1
0100100 => [1,1,2,1,2] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0]
 => [2,3,1,5,6,4,7] => ? = 3 - 1
0100101 => [1,1,2,1,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0]
 => [2,3,1,5,6,7,4] => ? = 4 - 1
0100110 => [1,1,2,2,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0]
 => [2,3,1,5,4,7,6] => ? = 3 - 1
0100111 => [1,1,2,3] => [1,0,1,0,1,1,0,0,1,1,1,0,0,0]
 => [2,3,1,5,4,6,7] => ? = 3 - 1
0101100 => [1,1,1,2,2] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0]
 => [2,3,4,1,6,5,7] => ? = 4 - 1
0101101 => [1,1,1,2,1,1] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0]
 => [2,3,4,1,6,7,5] => ? = 4 - 1
0110000 => [1,2,4] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0]
 => [2,1,4,3,5,6,7] => ? = 2 - 1
0110001 => [1,2,3,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0]
 => [2,1,4,3,5,7,6] => ? = 2 - 1
0110010 => [1,2,2,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
 => [2,1,4,3,6,7,5] => ? = 3 - 1
0110011 => [1,2,2,2] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [2,1,4,3,6,5,7] => ? = 2 - 1
0110100 => [1,2,1,1,2] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0]
 => [2,1,4,5,6,3,7] => ? = 4 - 1
0110101 => [1,2,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
 => [2,1,4,5,6,7,3] => ? = 5 - 1
0110110 => [1,2,1,2,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0]
 => [2,1,4,5,3,7,6] => ? = 3 - 1
0110111 => [1,2,1,3] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0]
 => [2,1,4,5,3,6,7] => ? = 3 - 1
0111000 => [1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0]
 => [2,1,3,5,4,6,7] => ? = 2 - 1
0111001 => [1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0]
 => [2,1,3,5,4,7,6] => ? = 2 - 1
0111010 => [1,3,1,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0]
 => [2,1,3,5,6,7,4] => ? = 4 - 1
0111011 => [1,3,1,2] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0]
 => [2,1,3,5,6,4,7] => ? = 3 - 1
0111100 => [1,4,2] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0]
 => [2,1,3,4,6,5,7] => ? = 2 - 1
0111101 => [1,4,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0]
 => [2,1,3,4,6,7,5] => ? = 3 - 1
0111110 => [1,5,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0]
 => [2,1,3,4,5,7,6] => ? = 2 - 1
1000001 => [1,5,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0]
 => [2,1,3,4,5,7,6] => ? = 2 - 1
1000010 => [1,4,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0]
 => [2,1,3,4,6,7,5] => ? = 3 - 1
1000011 => [1,4,2] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0]
 => [2,1,3,4,6,5,7] => ? = 2 - 1
1000100 => [1,3,1,2] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0]
 => [2,1,3,5,6,4,7] => ? = 3 - 1
1000101 => [1,3,1,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0]
 => [2,1,3,5,6,7,4] => ? = 4 - 1
1000110 => [1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0]
 => [2,1,3,5,4,7,6] => ? = 2 - 1
1000111 => [1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0]
 => [2,1,3,5,4,6,7] => ? = 2 - 1
1001000 => [1,2,1,3] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0]
 => [2,1,4,5,3,6,7] => ? = 3 - 1
1001001 => [1,2,1,2,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0]
 => [2,1,4,5,3,7,6] => ? = 3 - 1
1001010 => [1,2,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
 => [2,1,4,5,6,7,3] => ? = 5 - 1
1001011 => [1,2,1,1,2] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0]
 => [2,1,4,5,6,3,7] => ? = 4 - 1
1001100 => [1,2,2,2] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [2,1,4,3,6,5,7] => ? = 2 - 1
1001101 => [1,2,2,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
 => [2,1,4,3,6,7,5] => ? = 3 - 1
1001110 => [1,2,3,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0]
 => [2,1,4,3,5,7,6] => ? = 2 - 1
1001111 => [1,2,4] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0]
 => [2,1,4,3,5,6,7] => ? = 2 - 1
1010010 => [1,1,1,2,1,1] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0]
 => [2,3,4,1,6,7,5] => ? = 4 - 1
1010011 => [1,1,1,2,2] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0]
 => [2,3,4,1,6,5,7] => ? = 4 - 1
1011000 => [1,1,2,3] => [1,0,1,0,1,1,0,0,1,1,1,0,0,0]
 => [2,3,1,5,4,6,7] => ? = 3 - 1
1011001 => [1,1,2,2,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0]
 => [2,3,1,5,4,7,6] => ? = 3 - 1
1011010 => [1,1,2,1,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0]
 => [2,3,1,5,6,7,4] => ? = 4 - 1
1011011 => [1,1,2,1,2] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0]
 => [2,3,1,5,6,4,7] => ? = 3 - 1
1011100 => [1,1,3,2] => [1,0,1,0,1,1,1,0,0,0,1,1,0,0]
 => [2,3,1,4,6,5,7] => ? = 3 - 1
1011101 => [1,1,3,1,1] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0]
 => [2,3,1,4,6,7,5] => ? = 3 - 1
1011110 => [1,1,4,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0]
 => [2,3,1,4,5,7,6] => ? = 3 - 1
00000010 => [6,1,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0]
 => [1,2,3,4,5,7,8,6] => ? = 3 - 1
00000100 => [5,1,2] => [1,1,1,1,1,0,0,0,0,0,1,0,1,1,0,0]
 => [1,2,3,4,6,7,5,8] => ? = 3 - 1
Description
The number of pop-stack-sorts needed to sort a permutation. The pop-stack sorting operator is defined as follows. Process the permutation $\pi$ from left to right. If the stack is empty or its top element is smaller than the current element, empty the stack completely and append its elements to the output in reverse order. Next, push the current element onto the stack. After having processed the last entry, append the stack to the output in reverse order. A permutation is $t$-pop-stack sortable if it is sortable using $t$ pop-stacks in series.
Matching statistic: St000686
(load all 2 compositions to match this statistic)
Mapping
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000686: Dyck paths ⟶ ℤResult quality: 21% ●values known / values provided: 21%●distinct values known / distinct values provided: 78%
Values
0 => [1] => [1,0]
 => 1
1 => [1] => [1,0]
 => 1
00 => [2] => [1,1,0,0]
 => 1
01 => [1,1] => [1,0,1,0]
 => 2
10 => [1,1] => [1,0,1,0]
 => 2
11 => [2] => [1,1,0,0]
 => 1
000 => [3] => [1,1,1,0,0,0]
 => 1
001 => [2,1] => [1,1,0,0,1,0]
 => 2
010 => [1,1,1] => [1,0,1,0,1,0]
 => 3
011 => [1,2] => [1,0,1,1,0,0]
 => 2
100 => [1,2] => [1,0,1,1,0,0]
 => 2
101 => [1,1,1] => [1,0,1,0,1,0]
 => 3
110 => [2,1] => [1,1,0,0,1,0]
 => 2
111 => [3] => [1,1,1,0,0,0]
 => 1
0000 => [4] => [1,1,1,1,0,0,0,0]
 => 1
0001 => [3,1] => [1,1,1,0,0,0,1,0]
 => 2
0010 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 3
0011 => [2,2] => [1,1,0,0,1,1,0,0]
 => 2
0100 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 3
0101 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 4
0110 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
0111 => [1,3] => [1,0,1,1,1,0,0,0]
 => 2
1000 => [1,3] => [1,0,1,1,1,0,0,0]
 => 2
1001 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
1010 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 4
1011 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 3
1100 => [2,2] => [1,1,0,0,1,1,0,0]
 => 2
1101 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 3
1110 => [3,1] => [1,1,1,0,0,0,1,0]
 => 2
1111 => [4] => [1,1,1,1,0,0,0,0]
 => 1
00000 => [5] => [1,1,1,1,1,0,0,0,0,0]
 => 1
00001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 2
00010 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 3
00011 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
 => 2
00100 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 3
00101 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 4
00110 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
00111 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 2
01000 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => 3
01001 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 3
01010 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 5
01011 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => 4
01100 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
01101 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 3
01110 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
01111 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => 2
10000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => 2
10001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
10010 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 3
10011 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
00000000 => [8] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
 => ? = 1
00000001 => [7,1] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
 => ? = 2
00000010 => [6,1,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0]
 => ? = 3
00000011 => [6,2] => [1,1,1,1,1,1,0,0,0,0,0,0,1,1,0,0]
 => ? = 2
00000100 => [5,1,2] => [1,1,1,1,1,0,0,0,0,0,1,0,1,1,0,0]
 => ? = 3
00000101 => [5,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0]
 => ? = 4
00000110 => [5,2,1] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0,1,0]
 => ? = 2
00000111 => [5,3] => [1,1,1,1,1,0,0,0,0,0,1,1,1,0,0,0]
 => ? = 2
00001000 => [4,1,3] => [1,1,1,1,0,0,0,0,1,0,1,1,1,0,0,0]
 => ? = 3
00001001 => [4,1,2,1] => [1,1,1,1,0,0,0,0,1,0,1,1,0,0,1,0]
 => ? = 3
00001010 => [4,1,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0]
 => ? = 5
00001011 => [4,1,1,2] => [1,1,1,1,0,0,0,0,1,0,1,0,1,1,0,0]
 => ? = 4
00001100 => [4,2,2] => [1,1,1,1,0,0,0,0,1,1,0,0,1,1,0,0]
 => ? = 2
00001101 => [4,2,1,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0,1,0]
 => ? = 3
00001110 => [4,3,1] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0,1,0]
 => ? = 2
00001111 => [4,4] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
 => ? = 2
00010000 => [3,1,4] => [1,1,1,0,0,0,1,0,1,1,1,1,0,0,0,0]
 => ? = 3
00010001 => [3,1,3,1] => [1,1,1,0,0,0,1,0,1,1,1,0,0,0,1,0]
 => ? = 3
00010010 => [3,1,2,1,1] => [1,1,1,0,0,0,1,0,1,1,0,0,1,0,1,0]
 => ? = 3
00010011 => [3,1,2,2] => [1,1,1,0,0,0,1,0,1,1,0,0,1,1,0,0]
 => ? = 3
00010100 => [3,1,1,1,2] => [1,1,1,0,0,0,1,0,1,0,1,0,1,1,0,0]
 => ? = 5
00010101 => [3,1,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0]
 => ? = 6
00010110 => [3,1,1,2,1] => [1,1,1,0,0,0,1,0,1,0,1,1,0,0,1,0]
 => ? = 4
00010111 => [3,1,1,3] => [1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0]
 => ? = 4
00011000 => [3,2,3] => [1,1,1,0,0,0,1,1,0,0,1,1,1,0,0,0]
 => ? = 2
00011001 => [3,2,2,1] => [1,1,1,0,0,0,1,1,0,0,1,1,0,0,1,0]
 => ? = 2
00011010 => [3,2,1,1,1] => [1,1,1,0,0,0,1,1,0,0,1,0,1,0,1,0]
 => ? = 4
00011011 => [3,2,1,2] => [1,1,1,0,0,0,1,1,0,0,1,0,1,1,0,0]
 => ? = 3
00011100 => [3,3,2] => [1,1,1,0,0,0,1,1,1,0,0,0,1,1,0,0]
 => ? = 2
00011101 => [3,3,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,0]
 => ? = 3
00011110 => [3,4,1] => [1,1,1,0,0,0,1,1,1,1,0,0,0,0,1,0]
 => ? = 2
00011111 => [3,5] => [1,1,1,0,0,0,1,1,1,1,1,0,0,0,0,0]
 => ? = 2
00100000 => [2,1,5] => [1,1,0,0,1,0,1,1,1,1,1,0,0,0,0,0]
 => ? = 3
00100001 => [2,1,4,1] => [1,1,0,0,1,0,1,1,1,1,0,0,0,0,1,0]
 => ? = 3
00100010 => [2,1,3,1,1] => [1,1,0,0,1,0,1,1,1,0,0,0,1,0,1,0]
 => ? = 3
00100011 => [2,1,3,2] => [1,1,0,0,1,0,1,1,1,0,0,0,1,1,0,0]
 => ? = 3
00100100 => [2,1,2,1,2] => [1,1,0,0,1,0,1,1,0,0,1,0,1,1,0,0]
 => ? = 3
00100101 => [2,1,2,1,1,1] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0,1,0]
 => ? = 4
00100110 => [2,1,2,2,1] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0,1,0]
 => ? = 3
00100111 => [2,1,2,3] => [1,1,0,0,1,0,1,1,0,0,1,1,1,0,0,0]
 => ? = 3
00101000 => [2,1,1,1,3] => [1,1,0,0,1,0,1,0,1,0,1,1,1,0,0,0]
 => ? = 5
00101001 => [2,1,1,1,2,1] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0,1,0]
 => ? = 5
00101010 => [2,1,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
 => ? = 7
00101011 => [2,1,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0]
 => ? = 6
00101100 => [2,1,1,2,2] => [1,1,0,0,1,0,1,0,1,1,0,0,1,1,0,0]
 => ? = 4
00101101 => [2,1,1,2,1,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0]
 => ? = 4
00101110 => [2,1,1,3,1] => [1,1,0,0,1,0,1,0,1,1,1,0,0,0,1,0]
 => ? = 4
00101111 => [2,1,1,4] => [1,1,0,0,1,0,1,0,1,1,1,1,0,0,0,0]
 => ? = 4
00110000 => [2,2,4] => [1,1,0,0,1,1,0,0,1,1,1,1,0,0,0,0]
 => ? = 2
00110001 => [2,2,3,1] => [1,1,0,0,1,1,0,0,1,1,1,0,0,0,1,0]
 => ? = 2
Description
The finitistic dominant dimension of a Dyck path. To every LNakayama algebra there is a corresponding Dyck path, see also [[St000684]]. We associate the finitistic dominant dimension of the algebra to the corresponding Dyck path.
The following 35 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000028The number of stack-sorts needed to sort a permutation. St000209Maximum difference of elements in cycles. St000485The length of the longest cycle of a permutation. St000844The size of the largest block in the direct sum decomposition of a permutation. St000956The maximal displacement of a permutation. St001330The hat guessing number of a graph. St000454The largest eigenvalue of a graph if it is integral. St001235The global dimension of the corresponding Comp-Nakayama algebra. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St001530The depth of a Dyck path. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St000141The maximum drop size of a permutation. St000451The length of the longest pattern of the form k 1 2. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St000307The number of rowmotion orbits of a poset. St000632The jump number of the poset. St000272The treewidth of a graph. St000482The (zero)-forcing number of a graph. St000536The pathwidth of a graph. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000778The metric dimension of a graph. St001261The Castelnuovo-Mumford regularity of a graph. St001270The bandwidth of a graph. St001352The number of internal nodes in the modular decomposition of a graph. St001962The proper pathwidth of a graph. St000379The number of Hamiltonian cycles in a graph. St001331The size of the minimal feedback vertex set. St001333The cardinality of a minimal edge-isolating set of a graph. St001393The induced matching number of a graph. St001580The acyclic chromatic number of a graph. St001638The book thickness of a graph.