Loading [MathJax]/jax/output/HTML-CSS/jax.js

Your data matches 21 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Mp00199: Dyck paths prime Dyck pathDyck paths
St000981: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> 2
[1,0,1,0]
=> [1,1,0,1,0,0]
=> 4
[1,1,0,0]
=> [1,1,1,0,0,0]
=> 2
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 6
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 3
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 3
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 4
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 2
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 8
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 5
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 3
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 4
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 3
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 5
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 4
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 6
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 3
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 3
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 4
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 10
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> 5
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> 5
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> 3
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> 7
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> 5
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> 6
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> 3
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> 5
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> 3
[1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> 4
[1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> 6
[1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> 6
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,1,0,0,0]
=> 4
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,1,0,0,0]
=> 4
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,1,0,0,1,0,0]
=> 6
[1,0,1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,1,1,0,0,0,0]
=> 5
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,1,0,0,1,0,0,0]
=> 3
[1,0,1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,1,1,0,0,0,0,0]
=> 3
[1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,1,0,0,0]
=> 5
[1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,1,1,0,0,0,1,0,0,0]
=> 3
[1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,1,0,0,0,0,0]
=> 4
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,1,0,0,0]
=> 4
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,1,0,0,1,0,0]
=> 4
Description
The length of the longest zigzag subpath. This is the length of the longest consecutive subpath that is a zigzag of the form $010...$ or of the form $101...$.
Mp00093: Dyck paths to binary wordBinary words
Mp00104: Binary words reverseBinary words
Mp00158: Binary words alternating inverseBinary words
St000982: Binary words ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> 10 => 01 => 00 => 2
[1,0,1,0]
=> 1010 => 0101 => 0000 => 4
[1,1,0,0]
=> 1100 => 0011 => 0110 => 2
[1,0,1,0,1,0]
=> 101010 => 010101 => 000000 => 6
[1,0,1,1,0,0]
=> 101100 => 001101 => 011000 => 3
[1,1,0,0,1,0]
=> 110010 => 010011 => 000110 => 3
[1,1,0,1,0,0]
=> 110100 => 001011 => 011110 => 4
[1,1,1,0,0,0]
=> 111000 => 000111 => 010010 => 2
[1,0,1,0,1,0,1,0]
=> 10101010 => 01010101 => 00000000 => 8
[1,0,1,0,1,1,0,0]
=> 10101100 => 00110101 => 01100000 => 5
[1,0,1,1,0,0,1,0]
=> 10110010 => 01001101 => 00011000 => 3
[1,0,1,1,0,1,0,0]
=> 10110100 => 00101101 => 01111000 => 4
[1,0,1,1,1,0,0,0]
=> 10111000 => 00011101 => 01001000 => 3
[1,1,0,0,1,0,1,0]
=> 11001010 => 01010011 => 00000110 => 5
[1,1,0,0,1,1,0,0]
=> 11001100 => 00110011 => 01100110 => 2
[1,1,0,1,0,0,1,0]
=> 11010010 => 01001011 => 00011110 => 4
[1,1,0,1,0,1,0,0]
=> 11010100 => 00101011 => 01111110 => 6
[1,1,0,1,1,0,0,0]
=> 11011000 => 00011011 => 01001110 => 3
[1,1,1,0,0,0,1,0]
=> 11100010 => 01000111 => 00010010 => 3
[1,1,1,0,0,1,0,0]
=> 11100100 => 00100111 => 01110010 => 3
[1,1,1,0,1,0,0,0]
=> 11101000 => 00010111 => 01000010 => 4
[1,1,1,1,0,0,0,0]
=> 11110000 => 00001111 => 01011010 => 2
[1,0,1,0,1,0,1,0,1,0]
=> 1010101010 => 0101010101 => 0000000000 => 10
[1,0,1,0,1,1,0,0,1,0]
=> 1010110010 => 0100110101 => 0001100000 => 5
[1,0,1,1,0,0,1,0,1,0]
=> 1011001010 => 0101001101 => 0000011000 => 5
[1,0,1,1,0,1,0,0,1,0]
=> 1011010010 => 0100101101 => 0001111000 => 4
[1,0,1,1,1,0,0,0,1,0]
=> 1011100010 => 0100011101 => 0001001000 => 3
[1,1,0,0,1,0,1,0,1,0]
=> 1100101010 => 0101010011 => 0000000110 => 7
[1,1,0,0,1,1,0,0,1,0]
=> 1100110010 => 0100110011 => 0001100110 => 3
[1,1,0,1,0,0,1,0,1,0]
=> 1101001010 => 0101001011 => 0000011110 => 5
[1,1,0,1,0,1,0,0,1,0]
=> 1101010010 => 0100101011 => 0001111110 => 6
[1,1,0,1,1,0,0,0,1,0]
=> 1101100010 => 0100011011 => 0001001110 => 3
[1,1,1,0,0,0,1,0,1,0]
=> 1110001010 => 0101000111 => 0000010010 => 5
[1,1,1,0,0,1,0,0,1,0]
=> 1110010010 => 0100100111 => 0001110010 => 3
[1,1,1,0,1,0,0,0,1,0]
=> 1110100010 => 0100010111 => 0001000010 => 4
[1,1,1,0,1,0,1,0,0,0]
=> 1110101000 => 0001010111 => 0100000010 => 6
[1,1,1,1,0,0,0,0,1,0]
=> 1111000010 => 0100001111 => 0001011010 => 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> 101011010100 => 001010110101 => 011111100000 => 6
[1,0,1,1,0,0,1,1,0,1,0,0]
=> 101100110100 => 001011001101 => 011110011000 => 4
[1,0,1,1,0,1,0,0,1,1,0,0]
=> 101101001100 => 001100101101 => 011001111000 => 4
[1,0,1,1,0,1,0,1,0,0,1,0]
=> 101101010010 => 010010101101 => 000111111000 => 6
[1,0,1,1,0,1,0,1,1,0,0,0]
=> 101101011000 => 000110101101 => 010011111000 => 5
[1,0,1,1,0,1,1,0,0,1,0,0]
=> 101101100100 => 001001101101 => 011100111000 => 3
[1,0,1,1,0,1,1,1,0,0,0,0]
=> 101101110000 => 000011101101 => 010110111000 => 3
[1,0,1,1,1,0,0,1,0,1,0,0]
=> 101110010100 => 001010011101 => 011111001000 => 5
[1,0,1,1,1,1,0,0,0,1,0,0]
=> 101111000100 => 001000111101 => 011101101000 => 3
[1,0,1,1,1,1,0,1,0,0,0,0]
=> 101111010000 => 000010111101 => 010111101000 => 4
[1,1,0,0,1,0,1,1,0,1,0,0]
=> 110010110100 => 001011010011 => 011110000110 => 4
[1,1,0,0,1,1,0,0,1,1,0,0]
=> 110011001100 => 001100110011 => 011001100110 => 2
[1,1,0,0,1,1,0,1,0,0,1,0]
=> 110011010010 => 010010110011 => 000111100110 => 4
Description
The length of the longest constant subword.
Mp00093: Dyck paths to binary wordBinary words
Mp00105: Binary words complementBinary words
St000983: Binary words ⟶ ℤResult quality: 39% values known / values provided: 39%distinct values known / distinct values provided: 75%
Values
[1,0]
=> 10 => 01 => 2
[1,0,1,0]
=> 1010 => 0101 => 4
[1,1,0,0]
=> 1100 => 0011 => 2
[1,0,1,0,1,0]
=> 101010 => 010101 => 6
[1,0,1,1,0,0]
=> 101100 => 010011 => 3
[1,1,0,0,1,0]
=> 110010 => 001101 => 3
[1,1,0,1,0,0]
=> 110100 => 001011 => 4
[1,1,1,0,0,0]
=> 111000 => 000111 => 2
[1,0,1,0,1,0,1,0]
=> 10101010 => 01010101 => 8
[1,0,1,0,1,1,0,0]
=> 10101100 => 01010011 => 5
[1,0,1,1,0,0,1,0]
=> 10110010 => 01001101 => 3
[1,0,1,1,0,1,0,0]
=> 10110100 => 01001011 => 4
[1,0,1,1,1,0,0,0]
=> 10111000 => 01000111 => 3
[1,1,0,0,1,0,1,0]
=> 11001010 => 00110101 => 5
[1,1,0,0,1,1,0,0]
=> 11001100 => 00110011 => 2
[1,1,0,1,0,0,1,0]
=> 11010010 => 00101101 => 4
[1,1,0,1,0,1,0,0]
=> 11010100 => 00101011 => 6
[1,1,0,1,1,0,0,0]
=> 11011000 => 00100111 => 3
[1,1,1,0,0,0,1,0]
=> 11100010 => 00011101 => 3
[1,1,1,0,0,1,0,0]
=> 11100100 => 00011011 => 3
[1,1,1,0,1,0,0,0]
=> 11101000 => 00010111 => 4
[1,1,1,1,0,0,0,0]
=> 11110000 => 00001111 => 2
[1,0,1,0,1,0,1,0,1,0]
=> 1010101010 => 0101010101 => ? = 10
[1,0,1,0,1,1,0,0,1,0]
=> 1010110010 => 0101001101 => ? = 5
[1,0,1,1,0,0,1,0,1,0]
=> 1011001010 => 0100110101 => ? = 5
[1,0,1,1,0,1,0,0,1,0]
=> 1011010010 => 0100101101 => ? = 4
[1,0,1,1,1,0,0,0,1,0]
=> 1011100010 => 0100011101 => ? = 3
[1,1,0,0,1,0,1,0,1,0]
=> 1100101010 => 0011010101 => ? = 7
[1,1,0,0,1,1,0,0,1,0]
=> 1100110010 => 0011001101 => ? = 3
[1,1,0,1,0,0,1,0,1,0]
=> 1101001010 => 0010110101 => ? = 5
[1,1,0,1,0,1,0,0,1,0]
=> 1101010010 => 0010101101 => 6
[1,1,0,1,1,0,0,0,1,0]
=> 1101100010 => 0010011101 => 3
[1,1,1,0,0,0,1,0,1,0]
=> 1110001010 => 0001110101 => 5
[1,1,1,0,0,1,0,0,1,0]
=> 1110010010 => 0001101101 => 3
[1,1,1,0,1,0,0,0,1,0]
=> 1110100010 => 0001011101 => 4
[1,1,1,0,1,0,1,0,0,0]
=> 1110101000 => 0001010111 => 6
[1,1,1,1,0,0,0,0,1,0]
=> 1111000010 => 0000111101 => 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> 101011010100 => 010100101011 => ? = 6
[1,0,1,1,0,0,1,1,0,1,0,0]
=> 101100110100 => 010011001011 => ? = 4
[1,0,1,1,0,1,0,0,1,1,0,0]
=> 101101001100 => 010010110011 => ? = 4
[1,0,1,1,0,1,0,1,0,0,1,0]
=> 101101010010 => 010010101101 => ? = 6
[1,0,1,1,0,1,0,1,1,0,0,0]
=> 101101011000 => 010010100111 => ? = 5
[1,0,1,1,0,1,1,0,0,1,0,0]
=> 101101100100 => 010010011011 => ? = 3
[1,0,1,1,0,1,1,1,0,0,0,0]
=> 101101110000 => 010010001111 => ? = 3
[1,0,1,1,1,0,0,1,0,1,0,0]
=> 101110010100 => 010001101011 => ? = 5
[1,0,1,1,1,1,0,0,0,1,0,0]
=> 101111000100 => 010000111011 => ? = 3
[1,0,1,1,1,1,0,1,0,0,0,0]
=> 101111010000 => 010000101111 => ? = 4
[1,1,0,0,1,0,1,1,0,1,0,0]
=> 110010110100 => 001101001011 => ? = 4
[1,1,0,0,1,1,0,0,1,1,0,0]
=> 110011001100 => 001100110011 => ? = 2
[1,1,0,0,1,1,0,1,0,0,1,0]
=> 110011010010 => 001100101101 => ? = 4
[1,1,0,0,1,1,1,0,0,1,0,0]
=> 110011100100 => 001100011011 => ? = 3
[1,1,0,0,1,1,1,1,0,0,0,0]
=> 110011110000 => 001100001111 => ? = 2
[1,1,0,1,0,1,0,0,1,0,1,0]
=> 110101001010 => 001010110101 => ? = 6
[1,1,0,1,1,0,0,1,0,0,1,0]
=> 110110010010 => 001001101101 => ? = 3
[1,1,0,1,1,1,0,0,0,0,1,0]
=> 110111000010 => 001000111101 => ? = 3
[1,1,1,0,0,0,1,1,0,1,0,0]
=> 111000110100 => 000111001011 => ? = 4
[1,1,1,0,0,1,0,0,1,1,0,0]
=> 111001001100 => 000110110011 => ? = 3
[1,1,1,0,0,1,0,1,0,0,1,0]
=> 111001010010 => 000110101101 => ? = 5
[1,1,1,0,0,1,0,1,1,0,0,0]
=> 111001011000 => 000110100111 => ? = 4
[1,1,1,0,0,1,1,0,0,1,0,0]
=> 111001100100 => 000110011011 => ? = 3
[1,1,1,0,0,1,1,1,0,0,0,0]
=> 111001110000 => 000110001111 => ? = 2
[1,1,1,0,1,0,0,1,0,1,0,0]
=> 111010010100 => 000101101011 => ? = 5
[1,1,1,0,1,1,0,0,0,1,0,0]
=> 111011000100 => 000100111011 => ? = 3
[1,1,1,0,1,1,0,1,0,0,0,0]
=> 111011010000 => 000100101111 => ? = 4
[1,1,1,1,0,0,0,0,1,1,0,0]
=> 111100001100 => 000011110011 => ? = 2
[1,1,1,1,0,0,0,1,0,0,1,0]
=> 111100010010 => 000011101101 => ? = 3
[1,1,1,1,0,0,0,1,1,0,0,0]
=> 111100011000 => 000011100111 => ? = 2
[1,1,1,1,0,0,1,0,0,1,0,0]
=> 111100100100 => 000011011011 => ? = 3
[1,1,1,1,0,0,1,1,0,0,0,0]
=> 111100110000 => 000011001111 => ? = 2
[1,1,1,1,0,1,0,0,0,0,1,0]
=> 111101000010 => 000010111101 => ? = 4
[1,1,1,1,0,1,0,0,1,0,0,0]
=> 111101001000 => 000010110111 => ? = 4
[1,1,1,1,1,0,0,0,0,1,0,0]
=> 111110000100 => 000001111011 => ? = 3
[1,1,1,1,1,0,0,1,0,0,0,0]
=> 111110010000 => 000001101111 => ? = 3
[1,1,1,1,1,1,0,0,0,0,0,0]
=> 111111000000 => 000000111111 => ? = 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...$.
Mp00093: Dyck paths to binary wordBinary words
Mp00097: Binary words delta morphismInteger compositions
Mp00039: Integer compositions complementInteger compositions
St000381: Integer compositions ⟶ ℤResult quality: 30% values known / values provided: 30%distinct values known / distinct values provided: 75%
Values
[1,0]
=> 10 => [1,1] => [2] => 2
[1,0,1,0]
=> 1010 => [1,1,1,1] => [4] => 4
[1,1,0,0]
=> 1100 => [2,2] => [1,2,1] => 2
[1,0,1,0,1,0]
=> 101010 => [1,1,1,1,1,1] => [6] => 6
[1,0,1,1,0,0]
=> 101100 => [1,1,2,2] => [3,2,1] => 3
[1,1,0,0,1,0]
=> 110010 => [2,2,1,1] => [1,2,3] => 3
[1,1,0,1,0,0]
=> 110100 => [2,1,1,2] => [1,4,1] => 4
[1,1,1,0,0,0]
=> 111000 => [3,3] => [1,1,2,1,1] => 2
[1,0,1,0,1,0,1,0]
=> 10101010 => [1,1,1,1,1,1,1,1] => [8] => 8
[1,0,1,0,1,1,0,0]
=> 10101100 => [1,1,1,1,2,2] => [5,2,1] => 5
[1,0,1,1,0,0,1,0]
=> 10110010 => [1,1,2,2,1,1] => [3,2,3] => 3
[1,0,1,1,0,1,0,0]
=> 10110100 => [1,1,2,1,1,2] => [3,4,1] => 4
[1,0,1,1,1,0,0,0]
=> 10111000 => [1,1,3,3] => [3,1,2,1,1] => 3
[1,1,0,0,1,0,1,0]
=> 11001010 => [2,2,1,1,1,1] => [1,2,5] => 5
[1,1,0,0,1,1,0,0]
=> 11001100 => [2,2,2,2] => [1,2,2,2,1] => 2
[1,1,0,1,0,0,1,0]
=> 11010010 => [2,1,1,2,1,1] => [1,4,3] => 4
[1,1,0,1,0,1,0,0]
=> 11010100 => [2,1,1,1,1,2] => [1,6,1] => 6
[1,1,0,1,1,0,0,0]
=> 11011000 => [2,1,2,3] => [1,3,2,1,1] => 3
[1,1,1,0,0,0,1,0]
=> 11100010 => [3,3,1,1] => [1,1,2,1,3] => 3
[1,1,1,0,0,1,0,0]
=> 11100100 => [3,2,1,2] => [1,1,2,3,1] => 3
[1,1,1,0,1,0,0,0]
=> 11101000 => [3,1,1,3] => [1,1,4,1,1] => 4
[1,1,1,1,0,0,0,0]
=> 11110000 => [4,4] => [1,1,1,2,1,1,1] => 2
[1,0,1,0,1,0,1,0,1,0]
=> 1010101010 => [1,1,1,1,1,1,1,1,1,1] => [10] => ? = 10
[1,0,1,0,1,1,0,0,1,0]
=> 1010110010 => [1,1,1,1,2,2,1,1] => [5,2,3] => ? = 5
[1,0,1,1,0,0,1,0,1,0]
=> 1011001010 => [1,1,2,2,1,1,1,1] => [3,2,5] => ? = 5
[1,0,1,1,0,1,0,0,1,0]
=> 1011010010 => [1,1,2,1,1,2,1,1] => [3,4,3] => ? = 4
[1,0,1,1,1,0,0,0,1,0]
=> 1011100010 => [1,1,3,3,1,1] => [3,1,2,1,3] => ? = 3
[1,1,0,0,1,0,1,0,1,0]
=> 1100101010 => [2,2,1,1,1,1,1,1] => [1,2,7] => ? = 7
[1,1,0,0,1,1,0,0,1,0]
=> 1100110010 => [2,2,2,2,1,1] => [1,2,2,2,3] => ? = 3
[1,1,0,1,0,0,1,0,1,0]
=> 1101001010 => [2,1,1,2,1,1,1,1] => [1,4,5] => ? = 5
[1,1,0,1,0,1,0,0,1,0]
=> 1101010010 => [2,1,1,1,1,2,1,1] => [1,6,3] => ? = 6
[1,1,0,1,1,0,0,0,1,0]
=> 1101100010 => [2,1,2,3,1,1] => [1,3,2,1,3] => ? = 3
[1,1,1,0,0,0,1,0,1,0]
=> 1110001010 => [3,3,1,1,1,1] => [1,1,2,1,5] => ? = 5
[1,1,1,0,0,1,0,0,1,0]
=> 1110010010 => [3,2,1,2,1,1] => [1,1,2,3,3] => ? = 3
[1,1,1,0,1,0,0,0,1,0]
=> 1110100010 => [3,1,1,3,1,1] => [1,1,4,1,3] => ? = 4
[1,1,1,0,1,0,1,0,0,0]
=> 1110101000 => [3,1,1,1,1,3] => [1,1,6,1,1] => ? = 6
[1,1,1,1,0,0,0,0,1,0]
=> 1111000010 => [4,4,1,1] => [1,1,1,2,1,1,3] => ? = 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> 101011010100 => [1,1,1,1,2,1,1,1,1,2] => [5,6,1] => ? = 6
[1,0,1,1,0,0,1,1,0,1,0,0]
=> 101100110100 => [1,1,2,2,2,1,1,2] => [3,2,2,4,1] => ? = 4
[1,0,1,1,0,1,0,0,1,1,0,0]
=> 101101001100 => [1,1,2,1,1,2,2,2] => [3,4,2,2,1] => ? = 4
[1,0,1,1,0,1,0,1,0,0,1,0]
=> 101101010010 => [1,1,2,1,1,1,1,2,1,1] => [3,6,3] => ? = 6
[1,0,1,1,0,1,0,1,1,0,0,0]
=> 101101011000 => [1,1,2,1,1,1,2,3] => [3,5,2,1,1] => ? = 5
[1,0,1,1,0,1,1,0,0,1,0,0]
=> 101101100100 => [1,1,2,1,2,2,1,2] => [3,3,2,3,1] => ? = 3
[1,0,1,1,0,1,1,1,0,0,0,0]
=> 101101110000 => [1,1,2,1,3,4] => [3,3,1,2,1,1,1] => ? = 3
[1,0,1,1,1,0,0,1,0,1,0,0]
=> 101110010100 => [1,1,3,2,1,1,1,2] => [3,1,2,5,1] => ? = 5
[1,0,1,1,1,1,0,0,0,1,0,0]
=> 101111000100 => [1,1,4,3,1,2] => [3,1,1,2,1,3,1] => ? = 3
[1,0,1,1,1,1,0,1,0,0,0,0]
=> 101111010000 => [1,1,4,1,1,4] => [3,1,1,4,1,1,1] => ? = 4
[1,1,0,0,1,0,1,1,0,1,0,0]
=> 110010110100 => [2,2,1,1,2,1,1,2] => [1,2,4,4,1] => ? = 4
[1,1,0,0,1,1,0,0,1,1,0,0]
=> 110011001100 => [2,2,2,2,2,2] => [1,2,2,2,2,2,1] => ? = 2
[1,1,0,0,1,1,0,1,0,0,1,0]
=> 110011010010 => [2,2,2,1,1,2,1,1] => [1,2,2,4,3] => ? = 4
[1,1,0,0,1,1,1,0,0,1,0,0]
=> 110011100100 => [2,2,3,2,1,2] => [1,2,2,1,2,3,1] => ? = 3
[1,1,0,0,1,1,1,1,0,0,0,0]
=> 110011110000 => [2,2,4,4] => [1,2,2,1,1,2,1,1,1] => ? = 2
[1,1,0,1,0,1,0,0,1,0,1,0]
=> 110101001010 => [2,1,1,1,1,2,1,1,1,1] => [1,6,5] => ? = 6
[1,1,0,1,1,0,0,1,0,0,1,0]
=> 110110010010 => [2,1,2,2,1,2,1,1] => [1,3,2,3,3] => ? = 3
[1,1,0,1,1,1,0,0,0,0,1,0]
=> 110111000010 => [2,1,3,4,1,1] => [1,3,1,2,1,1,3] => ? = 3
[1,1,1,0,0,0,1,1,0,1,0,0]
=> 111000110100 => [3,3,2,1,1,2] => [1,1,2,1,2,4,1] => ? = 4
[1,1,1,0,0,1,0,0,1,1,0,0]
=> 111001001100 => [3,2,1,2,2,2] => [1,1,2,3,2,2,1] => ? = 3
[1,1,1,0,0,1,0,1,0,0,1,0]
=> 111001010010 => [3,2,1,1,1,2,1,1] => [1,1,2,5,3] => ? = 5
[1,1,1,0,0,1,0,1,1,0,0,0]
=> 111001011000 => [3,2,1,1,2,3] => [1,1,2,4,2,1,1] => ? = 4
[1,1,1,0,0,1,1,0,0,1,0,0]
=> 111001100100 => [3,2,2,2,1,2] => [1,1,2,2,2,3,1] => ? = 3
[1,1,1,0,0,1,1,1,0,0,0,0]
=> 111001110000 => [3,2,3,4] => [1,1,2,2,1,2,1,1,1] => ? = 2
[1,1,1,0,1,0,0,1,0,1,0,0]
=> 111010010100 => [3,1,1,2,1,1,1,2] => [1,1,4,5,1] => ? = 5
[1,1,1,0,1,1,0,0,0,1,0,0]
=> 111011000100 => [3,1,2,3,1,2] => [1,1,3,2,1,3,1] => ? = 3
[1,1,1,0,1,1,0,1,0,0,0,0]
=> 111011010000 => [3,1,2,1,1,4] => [1,1,3,4,1,1,1] => ? = 4
[1,1,1,1,0,0,0,0,1,1,0,0]
=> 111100001100 => [4,4,2,2] => [1,1,1,2,1,1,2,2,1] => ? = 2
[1,1,1,1,0,0,0,1,0,0,1,0]
=> 111100010010 => [4,3,1,2,1,1] => [1,1,1,2,1,3,3] => ? = 3
[1,1,1,1,0,0,0,1,1,0,0,0]
=> 111100011000 => [4,3,2,3] => [1,1,1,2,1,2,2,1,1] => ? = 2
[1,1,1,1,0,0,1,0,0,1,0,0]
=> 111100100100 => [4,2,1,2,1,2] => [1,1,1,2,3,3,1] => ? = 3
[1,1,1,1,0,0,1,1,0,0,0,0]
=> 111100110000 => [4,2,2,4] => [1,1,1,2,2,2,1,1,1] => ? = 2
[1,1,1,1,0,1,0,0,0,0,1,0]
=> 111101000010 => [4,1,1,4,1,1] => [1,1,1,4,1,1,3] => ? = 4
[1,1,1,1,0,1,0,0,1,0,0,0]
=> 111101001000 => [4,1,1,2,1,3] => [1,1,1,4,3,1,1] => ? = 4
[1,1,1,1,1,0,0,0,0,1,0,0]
=> 111110000100 => [5,4,1,2] => [1,1,1,1,2,1,1,3,1] => ? = 3
Description
The largest part of an integer composition.
Matching statistic: St000534
Mp00033: Dyck paths to two-row standard tableauStandard tableaux
Mp00081: Standard tableaux reading word permutationPermutations
Mp00223: Permutations runsortPermutations
St000534: Permutations ⟶ ℤResult quality: 18% values known / values provided: 18%distinct values known / distinct values provided: 50%
Values
[1,0]
=> [[1],[2]]
=> [2,1] => [1,2] => 0 = 2 - 2
[1,0,1,0]
=> [[1,3],[2,4]]
=> [2,4,1,3] => [1,3,2,4] => 2 = 4 - 2
[1,1,0,0]
=> [[1,2],[3,4]]
=> [3,4,1,2] => [1,2,3,4] => 0 = 2 - 2
[1,0,1,0,1,0]
=> [[1,3,5],[2,4,6]]
=> [2,4,6,1,3,5] => [1,3,5,2,4,6] => 4 = 6 - 2
[1,0,1,1,0,0]
=> [[1,3,4],[2,5,6]]
=> [2,5,6,1,3,4] => [1,3,4,2,5,6] => 1 = 3 - 2
[1,1,0,0,1,0]
=> [[1,2,5],[3,4,6]]
=> [3,4,6,1,2,5] => [1,2,5,3,4,6] => 1 = 3 - 2
[1,1,0,1,0,0]
=> [[1,2,4],[3,5,6]]
=> [3,5,6,1,2,4] => [1,2,4,3,5,6] => 2 = 4 - 2
[1,1,1,0,0,0]
=> [[1,2,3],[4,5,6]]
=> [4,5,6,1,2,3] => [1,2,3,4,5,6] => 0 = 2 - 2
[1,0,1,0,1,0,1,0]
=> [[1,3,5,7],[2,4,6,8]]
=> [2,4,6,8,1,3,5,7] => [1,3,5,7,2,4,6,8] => ? = 8 - 2
[1,0,1,0,1,1,0,0]
=> [[1,3,5,6],[2,4,7,8]]
=> [2,4,7,8,1,3,5,6] => [1,3,5,6,2,4,7,8] => ? = 5 - 2
[1,0,1,1,0,0,1,0]
=> [[1,3,4,7],[2,5,6,8]]
=> [2,5,6,8,1,3,4,7] => [1,3,4,7,2,5,6,8] => ? = 3 - 2
[1,0,1,1,0,1,0,0]
=> [[1,3,4,6],[2,5,7,8]]
=> [2,5,7,8,1,3,4,6] => [1,3,4,6,2,5,7,8] => ? = 4 - 2
[1,0,1,1,1,0,0,0]
=> [[1,3,4,5],[2,6,7,8]]
=> [2,6,7,8,1,3,4,5] => [1,3,4,5,2,6,7,8] => ? = 3 - 2
[1,1,0,0,1,0,1,0]
=> [[1,2,5,7],[3,4,6,8]]
=> [3,4,6,8,1,2,5,7] => [1,2,5,7,3,4,6,8] => ? = 5 - 2
[1,1,0,0,1,1,0,0]
=> [[1,2,5,6],[3,4,7,8]]
=> [3,4,7,8,1,2,5,6] => [1,2,5,6,3,4,7,8] => 0 = 2 - 2
[1,1,0,1,0,0,1,0]
=> [[1,2,4,7],[3,5,6,8]]
=> [3,5,6,8,1,2,4,7] => [1,2,4,7,3,5,6,8] => ? = 4 - 2
[1,1,0,1,0,1,0,0]
=> [[1,2,4,6],[3,5,7,8]]
=> [3,5,7,8,1,2,4,6] => [1,2,4,6,3,5,7,8] => ? = 6 - 2
[1,1,0,1,1,0,0,0]
=> [[1,2,4,5],[3,6,7,8]]
=> [3,6,7,8,1,2,4,5] => [1,2,4,5,3,6,7,8] => ? = 3 - 2
[1,1,1,0,0,0,1,0]
=> [[1,2,3,7],[4,5,6,8]]
=> [4,5,6,8,1,2,3,7] => [1,2,3,7,4,5,6,8] => 1 = 3 - 2
[1,1,1,0,0,1,0,0]
=> [[1,2,3,6],[4,5,7,8]]
=> [4,5,7,8,1,2,3,6] => [1,2,3,6,4,5,7,8] => 1 = 3 - 2
[1,1,1,0,1,0,0,0]
=> [[1,2,3,5],[4,6,7,8]]
=> [4,6,7,8,1,2,3,5] => [1,2,3,5,4,6,7,8] => 2 = 4 - 2
[1,1,1,1,0,0,0,0]
=> [[1,2,3,4],[5,6,7,8]]
=> [5,6,7,8,1,2,3,4] => [1,2,3,4,5,6,7,8] => 0 = 2 - 2
[1,0,1,0,1,0,1,0,1,0]
=> [[1,3,5,7,9],[2,4,6,8,10]]
=> [2,4,6,8,10,1,3,5,7,9] => [1,3,5,7,9,2,4,6,8,10] => ? = 10 - 2
[1,0,1,0,1,1,0,0,1,0]
=> [[1,3,5,6,9],[2,4,7,8,10]]
=> [2,4,7,8,10,1,3,5,6,9] => [1,3,5,6,9,2,4,7,8,10] => ? = 5 - 2
[1,0,1,1,0,0,1,0,1,0]
=> [[1,3,4,7,9],[2,5,6,8,10]]
=> [2,5,6,8,10,1,3,4,7,9] => [1,3,4,7,9,2,5,6,8,10] => ? = 5 - 2
[1,0,1,1,0,1,0,0,1,0]
=> [[1,3,4,6,9],[2,5,7,8,10]]
=> [2,5,7,8,10,1,3,4,6,9] => [1,3,4,6,9,2,5,7,8,10] => ? = 4 - 2
[1,0,1,1,1,0,0,0,1,0]
=> [[1,3,4,5,9],[2,6,7,8,10]]
=> [2,6,7,8,10,1,3,4,5,9] => [1,3,4,5,9,2,6,7,8,10] => ? = 3 - 2
[1,1,0,0,1,0,1,0,1,0]
=> [[1,2,5,7,9],[3,4,6,8,10]]
=> [3,4,6,8,10,1,2,5,7,9] => [1,2,5,7,9,3,4,6,8,10] => ? = 7 - 2
[1,1,0,0,1,1,0,0,1,0]
=> [[1,2,5,6,9],[3,4,7,8,10]]
=> [3,4,7,8,10,1,2,5,6,9] => [1,2,5,6,9,3,4,7,8,10] => ? = 3 - 2
[1,1,0,1,0,0,1,0,1,0]
=> [[1,2,4,7,9],[3,5,6,8,10]]
=> [3,5,6,8,10,1,2,4,7,9] => [1,2,4,7,9,3,5,6,8,10] => ? = 5 - 2
[1,1,0,1,0,1,0,0,1,0]
=> [[1,2,4,6,9],[3,5,7,8,10]]
=> [3,5,7,8,10,1,2,4,6,9] => [1,2,4,6,9,3,5,7,8,10] => ? = 6 - 2
[1,1,0,1,1,0,0,0,1,0]
=> [[1,2,4,5,9],[3,6,7,8,10]]
=> [3,6,7,8,10,1,2,4,5,9] => [1,2,4,5,9,3,6,7,8,10] => ? = 3 - 2
[1,1,1,0,0,0,1,0,1,0]
=> [[1,2,3,7,9],[4,5,6,8,10]]
=> [4,5,6,8,10,1,2,3,7,9] => [1,2,3,7,9,4,5,6,8,10] => ? = 5 - 2
[1,1,1,0,0,1,0,0,1,0]
=> [[1,2,3,6,9],[4,5,7,8,10]]
=> [4,5,7,8,10,1,2,3,6,9] => [1,2,3,6,9,4,5,7,8,10] => ? = 3 - 2
[1,1,1,0,1,0,0,0,1,0]
=> [[1,2,3,5,9],[4,6,7,8,10]]
=> [4,6,7,8,10,1,2,3,5,9] => [1,2,3,5,9,4,6,7,8,10] => ? = 4 - 2
[1,1,1,0,1,0,1,0,0,0]
=> [[1,2,3,5,7],[4,6,8,9,10]]
=> [4,6,8,9,10,1,2,3,5,7] => [1,2,3,5,7,4,6,8,9,10] => ? = 6 - 2
[1,1,1,1,0,0,0,0,1,0]
=> [[1,2,3,4,9],[5,6,7,8,10]]
=> [5,6,7,8,10,1,2,3,4,9] => [1,2,3,4,9,5,6,7,8,10] => ? = 3 - 2
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [[1,3,5,6,8,10],[2,4,7,9,11,12]]
=> [2,4,7,9,11,12,1,3,5,6,8,10] => [1,3,5,6,8,10,2,4,7,9,11,12] => ? = 6 - 2
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [[1,3,4,7,8,10],[2,5,6,9,11,12]]
=> [2,5,6,9,11,12,1,3,4,7,8,10] => [1,3,4,7,8,10,2,5,6,9,11,12] => ? = 4 - 2
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [[1,3,4,6,9,10],[2,5,7,8,11,12]]
=> [2,5,7,8,11,12,1,3,4,6,9,10] => [1,3,4,6,9,10,2,5,7,8,11,12] => ? = 4 - 2
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [[1,3,4,6,8,11],[2,5,7,9,10,12]]
=> [2,5,7,9,10,12,1,3,4,6,8,11] => [1,3,4,6,8,11,2,5,7,9,10,12] => ? = 6 - 2
[1,0,1,1,0,1,0,1,1,0,0,0]
=> [[1,3,4,6,8,9],[2,5,7,10,11,12]]
=> [2,5,7,10,11,12,1,3,4,6,8,9] => [1,3,4,6,8,9,2,5,7,10,11,12] => ? = 5 - 2
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [[1,3,4,6,7,10],[2,5,8,9,11,12]]
=> [2,5,8,9,11,12,1,3,4,6,7,10] => [1,3,4,6,7,10,2,5,8,9,11,12] => ? = 3 - 2
[1,0,1,1,0,1,1,1,0,0,0,0]
=> [[1,3,4,6,7,8],[2,5,9,10,11,12]]
=> [2,5,9,10,11,12,1,3,4,6,7,8] => [1,3,4,6,7,8,2,5,9,10,11,12] => ? = 3 - 2
[1,0,1,1,1,0,0,1,0,1,0,0]
=> [[1,3,4,5,8,10],[2,6,7,9,11,12]]
=> [2,6,7,9,11,12,1,3,4,5,8,10] => [1,3,4,5,8,10,2,6,7,9,11,12] => ? = 5 - 2
[1,0,1,1,1,1,0,0,0,1,0,0]
=> [[1,3,4,5,6,10],[2,7,8,9,11,12]]
=> [2,7,8,9,11,12,1,3,4,5,6,10] => [1,3,4,5,6,10,2,7,8,9,11,12] => ? = 3 - 2
[1,0,1,1,1,1,0,1,0,0,0,0]
=> [[1,3,4,5,6,8],[2,7,9,10,11,12]]
=> [2,7,9,10,11,12,1,3,4,5,6,8] => [1,3,4,5,6,8,2,7,9,10,11,12] => ? = 4 - 2
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [[1,2,5,7,8,10],[3,4,6,9,11,12]]
=> [3,4,6,9,11,12,1,2,5,7,8,10] => [1,2,5,7,8,10,3,4,6,9,11,12] => ? = 4 - 2
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [[1,2,5,6,9,10],[3,4,7,8,11,12]]
=> [3,4,7,8,11,12,1,2,5,6,9,10] => [1,2,5,6,9,10,3,4,7,8,11,12] => ? = 2 - 2
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [[1,2,5,6,8,11],[3,4,7,9,10,12]]
=> [3,4,7,9,10,12,1,2,5,6,8,11] => [1,2,5,6,8,11,3,4,7,9,10,12] => ? = 4 - 2
[1,1,0,0,1,1,1,0,0,1,0,0]
=> [[1,2,5,6,7,10],[3,4,8,9,11,12]]
=> [3,4,8,9,11,12,1,2,5,6,7,10] => [1,2,5,6,7,10,3,4,8,9,11,12] => ? = 3 - 2
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [[1,2,5,6,7,8],[3,4,9,10,11,12]]
=> [3,4,9,10,11,12,1,2,5,6,7,8] => [1,2,5,6,7,8,3,4,9,10,11,12] => ? = 2 - 2
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [[1,2,4,6,9,11],[3,5,7,8,10,12]]
=> [3,5,7,8,10,12,1,2,4,6,9,11] => [1,2,4,6,9,11,3,5,7,8,10,12] => ? = 6 - 2
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [[1,2,4,5,8,11],[3,6,7,9,10,12]]
=> [3,6,7,9,10,12,1,2,4,5,8,11] => [1,2,4,5,8,11,3,6,7,9,10,12] => ? = 3 - 2
[1,1,0,1,1,1,0,0,0,0,1,0]
=> [[1,2,4,5,6,11],[3,7,8,9,10,12]]
=> [3,7,8,9,10,12,1,2,4,5,6,11] => [1,2,4,5,6,11,3,7,8,9,10,12] => ? = 3 - 2
[1,1,1,0,0,0,1,1,0,1,0,0]
=> [[1,2,3,7,8,10],[4,5,6,9,11,12]]
=> [4,5,6,9,11,12,1,2,3,7,8,10] => [1,2,3,7,8,10,4,5,6,9,11,12] => ? = 4 - 2
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [[1,2,3,6,9,10],[4,5,7,8,11,12]]
=> [4,5,7,8,11,12,1,2,3,6,9,10] => [1,2,3,6,9,10,4,5,7,8,11,12] => ? = 3 - 2
[1,1,1,0,0,1,0,1,0,0,1,0]
=> [[1,2,3,6,8,11],[4,5,7,9,10,12]]
=> [4,5,7,9,10,12,1,2,3,6,8,11] => [1,2,3,6,8,11,4,5,7,9,10,12] => ? = 5 - 2
[1,1,1,0,0,1,0,1,1,0,0,0]
=> [[1,2,3,6,8,9],[4,5,7,10,11,12]]
=> [4,5,7,10,11,12,1,2,3,6,8,9] => [1,2,3,6,8,9,4,5,7,10,11,12] => ? = 4 - 2
[1,1,1,0,0,1,1,0,0,1,0,0]
=> [[1,2,3,6,7,10],[4,5,8,9,11,12]]
=> [4,5,8,9,11,12,1,2,3,6,7,10] => [1,2,3,6,7,10,4,5,8,9,11,12] => ? = 3 - 2
[1,1,1,0,0,1,1,1,0,0,0,0]
=> [[1,2,3,6,7,8],[4,5,9,10,11,12]]
=> [4,5,9,10,11,12,1,2,3,6,7,8] => [1,2,3,6,7,8,4,5,9,10,11,12] => ? = 2 - 2
[1,1,1,0,1,0,0,1,0,1,0,0]
=> [[1,2,3,5,8,10],[4,6,7,9,11,12]]
=> [4,6,7,9,11,12,1,2,3,5,8,10] => [1,2,3,5,8,10,4,6,7,9,11,12] => ? = 5 - 2
[1,1,1,0,1,1,0,0,0,1,0,0]
=> [[1,2,3,5,6,10],[4,7,8,9,11,12]]
=> [4,7,8,9,11,12,1,2,3,5,6,10] => [1,2,3,5,6,10,4,7,8,9,11,12] => ? = 3 - 2
Description
The number of 2-rises of a permutation. A 2-rise of a permutation $\pi$ is an index $i$ such that $\pi(i)+2 = \pi(i+1)$. For 1-rises, or successions, see [[St000441]].
Matching statistic: St000684
Mp00093: Dyck paths to binary wordBinary words
Mp00097: Binary words delta morphismInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St000684: Dyck paths ⟶ ℤResult quality: 16% values known / values provided: 16%distinct values known / distinct values provided: 75%
Values
[1,0]
=> 10 => [1,1] => [1,0,1,0]
=> 2
[1,0,1,0]
=> 1010 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,1,0,0]
=> 1100 => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,0,1,0,1,0]
=> 101010 => [1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6
[1,0,1,1,0,0]
=> 101100 => [1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,0,0,1,0]
=> 110010 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> 3
[1,1,0,1,0,0]
=> 110100 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> 4
[1,1,1,0,0,0]
=> 111000 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> 2
[1,0,1,0,1,0,1,0]
=> 10101010 => [1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 8
[1,0,1,0,1,1,0,0]
=> 10101100 => [1,1,1,1,2,2] => [1,0,1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> 5
[1,0,1,1,0,0,1,0]
=> 10110010 => [1,1,2,2,1,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> ? = 3
[1,0,1,1,0,1,0,0]
=> 10110100 => [1,1,2,1,1,2] => [1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> ? = 4
[1,0,1,1,1,0,0,0]
=> 10111000 => [1,1,3,3] => [1,0,1,0,1,1,1,0,0,0,1,1,1,0,0,0]
=> ? = 3
[1,1,0,0,1,0,1,0]
=> 11001010 => [2,2,1,1,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> 5
[1,1,0,0,1,1,0,0]
=> 11001100 => [2,2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> ? = 2
[1,1,0,1,0,0,1,0]
=> 11010010 => [2,1,1,2,1,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 4
[1,1,0,1,0,1,0,0]
=> 11010100 => [2,1,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 6
[1,1,0,1,1,0,0,0]
=> 11011000 => [2,1,2,3] => [1,1,0,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> ? = 3
[1,1,1,0,0,0,1,0]
=> 11100010 => [3,3,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 3
[1,1,1,0,0,1,0,0]
=> 11100100 => [3,2,1,2] => [1,1,1,0,0,0,1,1,0,0,1,0,1,1,0,0]
=> ? = 3
[1,1,1,0,1,0,0,0]
=> 11101000 => [3,1,1,3] => [1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0]
=> ? = 4
[1,1,1,1,0,0,0,0]
=> 11110000 => [4,4] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
=> ? = 2
[1,0,1,0,1,0,1,0,1,0]
=> 1010101010 => [1,1,1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 10
[1,0,1,0,1,1,0,0,1,0]
=> 1010110010 => [1,1,1,1,2,2,1,1] => [1,0,1,0,1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> ? = 5
[1,0,1,1,0,0,1,0,1,0]
=> 1011001010 => [1,1,2,2,1,1,1,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> ? = 5
[1,0,1,1,0,1,0,0,1,0]
=> 1011010010 => [1,1,2,1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 4
[1,0,1,1,1,0,0,0,1,0]
=> 1011100010 => [1,1,3,3,1,1] => [1,0,1,0,1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 3
[1,1,0,0,1,0,1,0,1,0]
=> 1100101010 => [2,2,1,1,1,1,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 7
[1,1,0,0,1,1,0,0,1,0]
=> 1100110010 => [2,2,2,2,1,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> ? = 3
[1,1,0,1,0,0,1,0,1,0]
=> 1101001010 => [2,1,1,2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> ? = 5
[1,1,0,1,0,1,0,0,1,0]
=> 1101010010 => [2,1,1,1,1,2,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 6
[1,1,0,1,1,0,0,0,1,0]
=> 1101100010 => [2,1,2,3,1,1] => [1,1,0,0,1,0,1,1,0,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 3
[1,1,1,0,0,0,1,0,1,0]
=> 1110001010 => [3,3,1,1,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> ? = 5
[1,1,1,0,0,1,0,0,1,0]
=> 1110010010 => [3,2,1,2,1,1] => [1,1,1,0,0,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 3
[1,1,1,0,1,0,0,0,1,0]
=> 1110100010 => [3,1,1,3,1,1] => [1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 4
[1,1,1,0,1,0,1,0,0,0]
=> 1110101000 => [3,1,1,1,1,3] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> ? = 6
[1,1,1,1,0,0,0,0,1,0]
=> 1111000010 => [4,4,1,1] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> 101011010100 => [1,1,1,1,2,1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> ? = 6
[1,0,1,1,0,0,1,1,0,1,0,0]
=> 101100110100 => [1,1,2,2,2,1,1,2] => [1,0,1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> ? = 4
[1,0,1,1,0,1,0,0,1,1,0,0]
=> 101101001100 => [1,1,2,1,1,2,2,2] => [1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> ? = 4
[1,0,1,1,0,1,0,1,0,0,1,0]
=> 101101010010 => [1,1,2,1,1,1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 6
[1,0,1,1,0,1,0,1,1,0,0,0]
=> 101101011000 => [1,1,2,1,1,1,2,3] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> ? = 5
[1,0,1,1,0,1,1,0,0,1,0,0]
=> 101101100100 => [1,1,2,1,2,2,1,2] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0,1,1,0,0,1,0,1,1,0,0]
=> ? = 3
[1,0,1,1,0,1,1,1,0,0,0,0]
=> 101101110000 => [1,1,2,1,3,4] => [1,0,1,0,1,1,0,0,1,0,1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> ? = 3
[1,0,1,1,1,0,0,1,0,1,0,0]
=> 101110010100 => [1,1,3,2,1,1,1,2] => [1,0,1,0,1,1,1,0,0,0,1,1,0,0,1,0,1,0,1,0,1,1,0,0]
=> ? = 5
[1,0,1,1,1,1,0,0,0,1,0,0]
=> 101111000100 => [1,1,4,3,1,2] => [1,0,1,0,1,1,1,1,0,0,0,0,1,1,1,0,0,0,1,0,1,1,0,0]
=> ? = 3
[1,0,1,1,1,1,0,1,0,0,0,0]
=> 101111010000 => [1,1,4,1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> ? = 4
[1,1,0,0,1,0,1,1,0,1,0,0]
=> 110010110100 => [2,2,1,1,2,1,1,2] => [1,1,0,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> ? = 4
[1,1,0,0,1,1,0,0,1,1,0,0]
=> 110011001100 => [2,2,2,2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> ? = 2
[1,1,0,0,1,1,0,1,0,0,1,0]
=> 110011010010 => [2,2,2,1,1,2,1,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 4
[1,1,0,0,1,1,1,0,0,1,0,0]
=> 110011100100 => [2,2,3,2,1,2] => [1,1,0,0,1,1,0,0,1,1,1,0,0,0,1,1,0,0,1,0,1,1,0,0]
=> ? = 3
[1,1,0,0,1,1,1,1,0,0,0,0]
=> 110011110000 => [2,2,4,4] => [1,1,0,0,1,1,0,0,1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
=> ? = 2
[1,1,0,1,0,1,0,0,1,0,1,0]
=> 110101001010 => [2,1,1,1,1,2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> ? = 6
[1,1,0,1,1,0,0,1,0,0,1,0]
=> 110110010010 => [2,1,2,2,1,2,1,1] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 3
[1,1,0,1,1,1,0,0,0,0,1,0]
=> 110111000010 => [2,1,3,4,1,1] => [1,1,0,0,1,0,1,1,1,0,0,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 3
[1,1,1,0,0,0,1,1,0,1,0,0]
=> 111000110100 => [3,3,2,1,1,2] => [1,1,1,0,0,0,1,1,1,0,0,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> ? = 4
[1,1,1,0,0,1,0,0,1,1,0,0]
=> 111001001100 => [3,2,1,2,2,2] => [1,1,1,0,0,0,1,1,0,0,1,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> ? = 3
[1,1,1,0,0,1,0,1,0,0,1,0]
=> 111001010010 => [3,2,1,1,1,2,1,1] => [1,1,1,0,0,0,1,1,0,0,1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 5
[1,1,1,0,0,1,0,1,1,0,0,0]
=> 111001011000 => [3,2,1,1,2,3] => [1,1,1,0,0,0,1,1,0,0,1,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> ? = 4
[1,1,1,0,0,1,1,0,0,1,0,0]
=> 111001100100 => [3,2,2,2,1,2] => [1,1,1,0,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0,1,1,0,0]
=> ? = 3
[1,1,1,0,0,1,1,1,0,0,0,0]
=> 111001110000 => [3,2,3,4] => [1,1,1,0,0,0,1,1,0,0,1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> ? = 2
[1,1,1,0,1,0,0,1,0,1,0,0]
=> 111010010100 => [3,1,1,2,1,1,1,2] => [1,1,1,0,0,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,1,0,0]
=> ? = 5
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.
Mp00093: Dyck paths to binary wordBinary words
Mp00097: Binary words delta morphismInteger compositions
St001235: Integer compositions ⟶ ℤResult quality: 11% values known / values provided: 11%distinct values known / distinct values provided: 50%
Values
[1,0]
=> 10 => [1,1] => 2
[1,0,1,0]
=> 1010 => [1,1,1,1] => 4
[1,1,0,0]
=> 1100 => [2,2] => 2
[1,0,1,0,1,0]
=> 101010 => [1,1,1,1,1,1] => 6
[1,0,1,1,0,0]
=> 101100 => [1,1,2,2] => 3
[1,1,0,0,1,0]
=> 110010 => [2,2,1,1] => 3
[1,1,0,1,0,0]
=> 110100 => [2,1,1,2] => 4
[1,1,1,0,0,0]
=> 111000 => [3,3] => 2
[1,0,1,0,1,0,1,0]
=> 10101010 => [1,1,1,1,1,1,1,1] => ? = 8
[1,0,1,0,1,1,0,0]
=> 10101100 => [1,1,1,1,2,2] => ? = 5
[1,0,1,1,0,0,1,0]
=> 10110010 => [1,1,2,2,1,1] => ? = 3
[1,0,1,1,0,1,0,0]
=> 10110100 => [1,1,2,1,1,2] => ? = 4
[1,0,1,1,1,0,0,0]
=> 10111000 => [1,1,3,3] => ? = 3
[1,1,0,0,1,0,1,0]
=> 11001010 => [2,2,1,1,1,1] => ? = 5
[1,1,0,0,1,1,0,0]
=> 11001100 => [2,2,2,2] => ? = 2
[1,1,0,1,0,0,1,0]
=> 11010010 => [2,1,1,2,1,1] => ? = 4
[1,1,0,1,0,1,0,0]
=> 11010100 => [2,1,1,1,1,2] => ? = 6
[1,1,0,1,1,0,0,0]
=> 11011000 => [2,1,2,3] => ? = 3
[1,1,1,0,0,0,1,0]
=> 11100010 => [3,3,1,1] => ? = 3
[1,1,1,0,0,1,0,0]
=> 11100100 => [3,2,1,2] => ? = 3
[1,1,1,0,1,0,0,0]
=> 11101000 => [3,1,1,3] => ? = 4
[1,1,1,1,0,0,0,0]
=> 11110000 => [4,4] => ? = 2
[1,0,1,0,1,0,1,0,1,0]
=> 1010101010 => [1,1,1,1,1,1,1,1,1,1] => ? = 10
[1,0,1,0,1,1,0,0,1,0]
=> 1010110010 => [1,1,1,1,2,2,1,1] => ? = 5
[1,0,1,1,0,0,1,0,1,0]
=> 1011001010 => [1,1,2,2,1,1,1,1] => ? = 5
[1,0,1,1,0,1,0,0,1,0]
=> 1011010010 => [1,1,2,1,1,2,1,1] => ? = 4
[1,0,1,1,1,0,0,0,1,0]
=> 1011100010 => [1,1,3,3,1,1] => ? = 3
[1,1,0,0,1,0,1,0,1,0]
=> 1100101010 => [2,2,1,1,1,1,1,1] => ? = 7
[1,1,0,0,1,1,0,0,1,0]
=> 1100110010 => [2,2,2,2,1,1] => ? = 3
[1,1,0,1,0,0,1,0,1,0]
=> 1101001010 => [2,1,1,2,1,1,1,1] => ? = 5
[1,1,0,1,0,1,0,0,1,0]
=> 1101010010 => [2,1,1,1,1,2,1,1] => ? = 6
[1,1,0,1,1,0,0,0,1,0]
=> 1101100010 => [2,1,2,3,1,1] => ? = 3
[1,1,1,0,0,0,1,0,1,0]
=> 1110001010 => [3,3,1,1,1,1] => ? = 5
[1,1,1,0,0,1,0,0,1,0]
=> 1110010010 => [3,2,1,2,1,1] => ? = 3
[1,1,1,0,1,0,0,0,1,0]
=> 1110100010 => [3,1,1,3,1,1] => ? = 4
[1,1,1,0,1,0,1,0,0,0]
=> 1110101000 => [3,1,1,1,1,3] => ? = 6
[1,1,1,1,0,0,0,0,1,0]
=> 1111000010 => [4,4,1,1] => ? = 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> 101011010100 => [1,1,1,1,2,1,1,1,1,2] => ? = 6
[1,0,1,1,0,0,1,1,0,1,0,0]
=> 101100110100 => [1,1,2,2,2,1,1,2] => ? = 4
[1,0,1,1,0,1,0,0,1,1,0,0]
=> 101101001100 => [1,1,2,1,1,2,2,2] => ? = 4
[1,0,1,1,0,1,0,1,0,0,1,0]
=> 101101010010 => [1,1,2,1,1,1,1,2,1,1] => ? = 6
[1,0,1,1,0,1,0,1,1,0,0,0]
=> 101101011000 => [1,1,2,1,1,1,2,3] => ? = 5
[1,0,1,1,0,1,1,0,0,1,0,0]
=> 101101100100 => [1,1,2,1,2,2,1,2] => ? = 3
[1,0,1,1,0,1,1,1,0,0,0,0]
=> 101101110000 => [1,1,2,1,3,4] => ? = 3
[1,0,1,1,1,0,0,1,0,1,0,0]
=> 101110010100 => [1,1,3,2,1,1,1,2] => ? = 5
[1,0,1,1,1,1,0,0,0,1,0,0]
=> 101111000100 => [1,1,4,3,1,2] => ? = 3
[1,0,1,1,1,1,0,1,0,0,0,0]
=> 101111010000 => [1,1,4,1,1,4] => ? = 4
[1,1,0,0,1,0,1,1,0,1,0,0]
=> 110010110100 => [2,2,1,1,2,1,1,2] => ? = 4
[1,1,0,0,1,1,0,0,1,1,0,0]
=> 110011001100 => [2,2,2,2,2,2] => ? = 2
[1,1,0,0,1,1,0,1,0,0,1,0]
=> 110011010010 => [2,2,2,1,1,2,1,1] => ? = 4
[1,1,0,0,1,1,1,0,0,1,0,0]
=> 110011100100 => [2,2,3,2,1,2] => ? = 3
[1,1,0,0,1,1,1,1,0,0,0,0]
=> 110011110000 => [2,2,4,4] => ? = 2
[1,1,0,1,0,1,0,0,1,0,1,0]
=> 110101001010 => [2,1,1,1,1,2,1,1,1,1] => ? = 6
[1,1,0,1,1,0,0,1,0,0,1,0]
=> 110110010010 => [2,1,2,2,1,2,1,1] => ? = 3
[1,1,0,1,1,1,0,0,0,0,1,0]
=> 110111000010 => [2,1,3,4,1,1] => ? = 3
[1,1,1,0,0,0,1,1,0,1,0,0]
=> 111000110100 => [3,3,2,1,1,2] => ? = 4
[1,1,1,0,0,1,0,0,1,1,0,0]
=> 111001001100 => [3,2,1,2,2,2] => ? = 3
[1,1,1,0,0,1,0,1,0,0,1,0]
=> 111001010010 => [3,2,1,1,1,2,1,1] => ? = 5
Description
The global dimension of the corresponding Comp-Nakayama algebra. We identify the composition [n1-1,n2-1,...,nr-1] with the Nakayama algebra with Kupisch series [n1,n1-1,...,2,n2,n2-1,...,2,...,nr,nr-1,...,3,2,1]. We call such Nakayama algebras with Kupisch series corresponding to a integer composition "Comp-Nakayama algebra".
Matching statistic: St000686
Mp00093: Dyck paths to binary wordBinary words
Mp00097: Binary words delta morphismInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St000686: Dyck paths ⟶ ℤResult quality: 11% values known / values provided: 11%distinct values known / distinct values provided: 50%
Values
[1,0]
=> 10 => [1,1] => [1,0,1,0]
=> 2
[1,0,1,0]
=> 1010 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,1,0,0]
=> 1100 => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,0,1,0,1,0]
=> 101010 => [1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6
[1,0,1,1,0,0]
=> 101100 => [1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,0,0,1,0]
=> 110010 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> 3
[1,1,0,1,0,0]
=> 110100 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> 4
[1,1,1,0,0,0]
=> 111000 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> 2
[1,0,1,0,1,0,1,0]
=> 10101010 => [1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 8
[1,0,1,0,1,1,0,0]
=> 10101100 => [1,1,1,1,2,2] => [1,0,1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> ? = 5
[1,0,1,1,0,0,1,0]
=> 10110010 => [1,1,2,2,1,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> ? = 3
[1,0,1,1,0,1,0,0]
=> 10110100 => [1,1,2,1,1,2] => [1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> ? = 4
[1,0,1,1,1,0,0,0]
=> 10111000 => [1,1,3,3] => [1,0,1,0,1,1,1,0,0,0,1,1,1,0,0,0]
=> ? = 3
[1,1,0,0,1,0,1,0]
=> 11001010 => [2,2,1,1,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> ? = 5
[1,1,0,0,1,1,0,0]
=> 11001100 => [2,2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> ? = 2
[1,1,0,1,0,0,1,0]
=> 11010010 => [2,1,1,2,1,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 4
[1,1,0,1,0,1,0,0]
=> 11010100 => [2,1,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> ? = 6
[1,1,0,1,1,0,0,0]
=> 11011000 => [2,1,2,3] => [1,1,0,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> ? = 3
[1,1,1,0,0,0,1,0]
=> 11100010 => [3,3,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 3
[1,1,1,0,0,1,0,0]
=> 11100100 => [3,2,1,2] => [1,1,1,0,0,0,1,1,0,0,1,0,1,1,0,0]
=> ? = 3
[1,1,1,0,1,0,0,0]
=> 11101000 => [3,1,1,3] => [1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0]
=> ? = 4
[1,1,1,1,0,0,0,0]
=> 11110000 => [4,4] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
=> ? = 2
[1,0,1,0,1,0,1,0,1,0]
=> 1010101010 => [1,1,1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 10
[1,0,1,0,1,1,0,0,1,0]
=> 1010110010 => [1,1,1,1,2,2,1,1] => [1,0,1,0,1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> ? = 5
[1,0,1,1,0,0,1,0,1,0]
=> 1011001010 => [1,1,2,2,1,1,1,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> ? = 5
[1,0,1,1,0,1,0,0,1,0]
=> 1011010010 => [1,1,2,1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 4
[1,0,1,1,1,0,0,0,1,0]
=> 1011100010 => [1,1,3,3,1,1] => [1,0,1,0,1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 3
[1,1,0,0,1,0,1,0,1,0]
=> 1100101010 => [2,2,1,1,1,1,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 7
[1,1,0,0,1,1,0,0,1,0]
=> 1100110010 => [2,2,2,2,1,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> ? = 3
[1,1,0,1,0,0,1,0,1,0]
=> 1101001010 => [2,1,1,2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> ? = 5
[1,1,0,1,0,1,0,0,1,0]
=> 1101010010 => [2,1,1,1,1,2,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 6
[1,1,0,1,1,0,0,0,1,0]
=> 1101100010 => [2,1,2,3,1,1] => [1,1,0,0,1,0,1,1,0,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 3
[1,1,1,0,0,0,1,0,1,0]
=> 1110001010 => [3,3,1,1,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> ? = 5
[1,1,1,0,0,1,0,0,1,0]
=> 1110010010 => [3,2,1,2,1,1] => [1,1,1,0,0,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 3
[1,1,1,0,1,0,0,0,1,0]
=> 1110100010 => [3,1,1,3,1,1] => [1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 4
[1,1,1,0,1,0,1,0,0,0]
=> 1110101000 => [3,1,1,1,1,3] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> ? = 6
[1,1,1,1,0,0,0,0,1,0]
=> 1111000010 => [4,4,1,1] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> 101011010100 => [1,1,1,1,2,1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> ? = 6
[1,0,1,1,0,0,1,1,0,1,0,0]
=> 101100110100 => [1,1,2,2,2,1,1,2] => [1,0,1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> ? = 4
[1,0,1,1,0,1,0,0,1,1,0,0]
=> 101101001100 => [1,1,2,1,1,2,2,2] => [1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> ? = 4
[1,0,1,1,0,1,0,1,0,0,1,0]
=> 101101010010 => [1,1,2,1,1,1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 6
[1,0,1,1,0,1,0,1,1,0,0,0]
=> 101101011000 => [1,1,2,1,1,1,2,3] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> ? = 5
[1,0,1,1,0,1,1,0,0,1,0,0]
=> 101101100100 => [1,1,2,1,2,2,1,2] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0,1,1,0,0,1,0,1,1,0,0]
=> ? = 3
[1,0,1,1,0,1,1,1,0,0,0,0]
=> 101101110000 => [1,1,2,1,3,4] => [1,0,1,0,1,1,0,0,1,0,1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> ? = 3
[1,0,1,1,1,0,0,1,0,1,0,0]
=> 101110010100 => [1,1,3,2,1,1,1,2] => [1,0,1,0,1,1,1,0,0,0,1,1,0,0,1,0,1,0,1,0,1,1,0,0]
=> ? = 5
[1,0,1,1,1,1,0,0,0,1,0,0]
=> 101111000100 => [1,1,4,3,1,2] => [1,0,1,0,1,1,1,1,0,0,0,0,1,1,1,0,0,0,1,0,1,1,0,0]
=> ? = 3
[1,0,1,1,1,1,0,1,0,0,0,0]
=> 101111010000 => [1,1,4,1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> ? = 4
[1,1,0,0,1,0,1,1,0,1,0,0]
=> 110010110100 => [2,2,1,1,2,1,1,2] => [1,1,0,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> ? = 4
[1,1,0,0,1,1,0,0,1,1,0,0]
=> 110011001100 => [2,2,2,2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> ? = 2
[1,1,0,0,1,1,0,1,0,0,1,0]
=> 110011010010 => [2,2,2,1,1,2,1,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 4
[1,1,0,0,1,1,1,0,0,1,0,0]
=> 110011100100 => [2,2,3,2,1,2] => [1,1,0,0,1,1,0,0,1,1,1,0,0,0,1,1,0,0,1,0,1,1,0,0]
=> ? = 3
[1,1,0,0,1,1,1,1,0,0,0,0]
=> 110011110000 => [2,2,4,4] => [1,1,0,0,1,1,0,0,1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
=> ? = 2
[1,1,0,1,0,1,0,0,1,0,1,0]
=> 110101001010 => [2,1,1,1,1,2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> ? = 6
[1,1,0,1,1,0,0,1,0,0,1,0]
=> 110110010010 => [2,1,2,2,1,2,1,1] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 3
[1,1,0,1,1,1,0,0,0,0,1,0]
=> 110111000010 => [2,1,3,4,1,1] => [1,1,0,0,1,0,1,1,1,0,0,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 3
[1,1,1,0,0,0,1,1,0,1,0,0]
=> 111000110100 => [3,3,2,1,1,2] => [1,1,1,0,0,0,1,1,1,0,0,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> ? = 4
[1,1,1,0,0,1,0,0,1,1,0,0]
=> 111001001100 => [3,2,1,2,2,2] => [1,1,1,0,0,0,1,1,0,0,1,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> ? = 3
[1,1,1,0,0,1,0,1,0,0,1,0]
=> 111001010010 => [3,2,1,1,1,2,1,1] => [1,1,1,0,0,0,1,1,0,0,1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 5
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.
Matching statistic: St000887
Mp00146: Dyck paths to tunnel matchingPerfect matchings
Mp00058: Perfect matchings to permutationPermutations
Mp00090: Permutations cycle-as-one-line notationPermutations
St000887: Permutations ⟶ ℤResult quality: 11% values known / values provided: 11%distinct values known / distinct values provided: 50%
Values
[1,0]
=> [(1,2)]
=> [2,1] => [1,2] => 2
[1,0,1,0]
=> [(1,2),(3,4)]
=> [2,1,4,3] => [1,2,3,4] => 4
[1,1,0,0]
=> [(1,4),(2,3)]
=> [4,3,2,1] => [1,4,2,3] => 2
[1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6)]
=> [2,1,4,3,6,5] => [1,2,3,4,5,6] => 6
[1,0,1,1,0,0]
=> [(1,2),(3,6),(4,5)]
=> [2,1,6,5,4,3] => [1,2,3,6,4,5] => 3
[1,1,0,0,1,0]
=> [(1,4),(2,3),(5,6)]
=> [4,3,2,1,6,5] => [1,4,2,3,5,6] => 3
[1,1,0,1,0,0]
=> [(1,6),(2,3),(4,5)]
=> [6,3,2,5,4,1] => [1,6,2,3,4,5] => 4
[1,1,1,0,0,0]
=> [(1,6),(2,5),(3,4)]
=> [6,5,4,3,2,1] => [1,6,2,5,3,4] => 2
[1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8)]
=> [2,1,4,3,6,5,8,7] => [1,2,3,4,5,6,7,8] => ? = 8
[1,0,1,0,1,1,0,0]
=> [(1,2),(3,4),(5,8),(6,7)]
=> [2,1,4,3,8,7,6,5] => [1,2,3,4,5,8,6,7] => ? = 5
[1,0,1,1,0,0,1,0]
=> [(1,2),(3,6),(4,5),(7,8)]
=> [2,1,6,5,4,3,8,7] => [1,2,3,6,4,5,7,8] => ? = 3
[1,0,1,1,0,1,0,0]
=> [(1,2),(3,8),(4,5),(6,7)]
=> [2,1,8,5,4,7,6,3] => [1,2,3,8,4,5,6,7] => ? = 4
[1,0,1,1,1,0,0,0]
=> [(1,2),(3,8),(4,7),(5,6)]
=> [2,1,8,7,6,5,4,3] => [1,2,3,8,4,7,5,6] => ? = 3
[1,1,0,0,1,0,1,0]
=> [(1,4),(2,3),(5,6),(7,8)]
=> [4,3,2,1,6,5,8,7] => [1,4,2,3,5,6,7,8] => ? = 5
[1,1,0,0,1,1,0,0]
=> [(1,4),(2,3),(5,8),(6,7)]
=> [4,3,2,1,8,7,6,5] => [1,4,2,3,5,8,6,7] => ? = 2
[1,1,0,1,0,0,1,0]
=> [(1,6),(2,3),(4,5),(7,8)]
=> [6,3,2,5,4,1,8,7] => [1,6,2,3,4,5,7,8] => ? = 4
[1,1,0,1,0,1,0,0]
=> [(1,8),(2,3),(4,5),(6,7)]
=> [8,3,2,5,4,7,6,1] => [1,8,2,3,4,5,6,7] => ? = 6
[1,1,0,1,1,0,0,0]
=> [(1,8),(2,3),(4,7),(5,6)]
=> [8,3,2,7,6,5,4,1] => [1,8,2,3,4,7,5,6] => ? = 3
[1,1,1,0,0,0,1,0]
=> [(1,6),(2,5),(3,4),(7,8)]
=> [6,5,4,3,2,1,8,7] => [1,6,2,5,3,4,7,8] => ? = 3
[1,1,1,0,0,1,0,0]
=> [(1,8),(2,5),(3,4),(6,7)]
=> [8,5,4,3,2,7,6,1] => [1,8,2,5,3,4,6,7] => ? = 3
[1,1,1,0,1,0,0,0]
=> [(1,8),(2,7),(3,4),(5,6)]
=> [8,7,4,3,6,5,2,1] => [1,8,2,7,3,4,5,6] => ? = 4
[1,1,1,1,0,0,0,0]
=> [(1,8),(2,7),(3,6),(4,5)]
=> [8,7,6,5,4,3,2,1] => [1,8,2,7,3,6,4,5] => ? = 2
[1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> [2,1,4,3,6,5,8,7,10,9] => [1,2,3,4,5,6,7,8,9,10] => ? = 10
[1,0,1,0,1,1,0,0,1,0]
=> [(1,2),(3,4),(5,8),(6,7),(9,10)]
=> [2,1,4,3,8,7,6,5,10,9] => [1,2,3,4,5,8,6,7,9,10] => ? = 5
[1,0,1,1,0,0,1,0,1,0]
=> [(1,2),(3,6),(4,5),(7,8),(9,10)]
=> [2,1,6,5,4,3,8,7,10,9] => [1,2,3,6,4,5,7,8,9,10] => ? = 5
[1,0,1,1,0,1,0,0,1,0]
=> [(1,2),(3,8),(4,5),(6,7),(9,10)]
=> [2,1,8,5,4,7,6,3,10,9] => [1,2,3,8,4,5,6,7,9,10] => ? = 4
[1,0,1,1,1,0,0,0,1,0]
=> [(1,2),(3,8),(4,7),(5,6),(9,10)]
=> [2,1,8,7,6,5,4,3,10,9] => [1,2,3,8,4,7,5,6,9,10] => ? = 3
[1,1,0,0,1,0,1,0,1,0]
=> [(1,4),(2,3),(5,6),(7,8),(9,10)]
=> [4,3,2,1,6,5,8,7,10,9] => [1,4,2,3,5,6,7,8,9,10] => ? = 7
[1,1,0,0,1,1,0,0,1,0]
=> [(1,4),(2,3),(5,8),(6,7),(9,10)]
=> [4,3,2,1,8,7,6,5,10,9] => [1,4,2,3,5,8,6,7,9,10] => ? = 3
[1,1,0,1,0,0,1,0,1,0]
=> [(1,6),(2,3),(4,5),(7,8),(9,10)]
=> [6,3,2,5,4,1,8,7,10,9] => [1,6,2,3,4,5,7,8,9,10] => ? = 5
[1,1,0,1,0,1,0,0,1,0]
=> [(1,8),(2,3),(4,5),(6,7),(9,10)]
=> [8,3,2,5,4,7,6,1,10,9] => [1,8,2,3,4,5,6,7,9,10] => ? = 6
[1,1,0,1,1,0,0,0,1,0]
=> [(1,8),(2,3),(4,7),(5,6),(9,10)]
=> [8,3,2,7,6,5,4,1,10,9] => [1,8,2,3,4,7,5,6,9,10] => ? = 3
[1,1,1,0,0,0,1,0,1,0]
=> [(1,6),(2,5),(3,4),(7,8),(9,10)]
=> [6,5,4,3,2,1,8,7,10,9] => [1,6,2,5,3,4,7,8,9,10] => ? = 5
[1,1,1,0,0,1,0,0,1,0]
=> [(1,8),(2,5),(3,4),(6,7),(9,10)]
=> [8,5,4,3,2,7,6,1,10,9] => [1,8,2,5,3,4,6,7,9,10] => ? = 3
[1,1,1,0,1,0,0,0,1,0]
=> [(1,8),(2,7),(3,4),(5,6),(9,10)]
=> [8,7,4,3,6,5,2,1,10,9] => [1,8,2,7,3,4,5,6,9,10] => ? = 4
[1,1,1,0,1,0,1,0,0,0]
=> [(1,10),(2,9),(3,4),(5,6),(7,8)]
=> [10,9,4,3,6,5,8,7,2,1] => [1,10,2,9,3,4,5,6,7,8] => ? = 6
[1,1,1,1,0,0,0,0,1,0]
=> [(1,8),(2,7),(3,6),(4,5),(9,10)]
=> [8,7,6,5,4,3,2,1,10,9] => [1,8,2,7,3,6,4,5,9,10] => ? = 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [(1,2),(3,4),(5,12),(6,7),(8,9),(10,11)]
=> [2,1,4,3,12,7,6,9,8,11,10,5] => [1,2,3,4,5,12,6,7,8,9,10,11] => ? = 6
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [(1,2),(3,6),(4,5),(7,12),(8,9),(10,11)]
=> [2,1,6,5,4,3,12,9,8,11,10,7] => [1,2,3,6,4,5,7,12,8,9,10,11] => ? = 4
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [(1,2),(3,8),(4,5),(6,7),(9,12),(10,11)]
=> [2,1,8,5,4,7,6,3,12,11,10,9] => [1,2,3,8,4,5,6,7,9,12,10,11] => ? = 4
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [(1,2),(3,10),(4,5),(6,7),(8,9),(11,12)]
=> [2,1,10,5,4,7,6,9,8,3,12,11] => [1,2,3,10,4,5,6,7,8,9,11,12] => ? = 6
[1,0,1,1,0,1,0,1,1,0,0,0]
=> [(1,2),(3,12),(4,5),(6,7),(8,11),(9,10)]
=> [2,1,12,5,4,7,6,11,10,9,8,3] => [1,2,3,12,4,5,6,7,8,11,9,10] => ? = 5
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [(1,2),(3,12),(4,5),(6,9),(7,8),(10,11)]
=> [2,1,12,5,4,9,8,7,6,11,10,3] => [1,2,3,12,4,5,6,9,7,8,10,11] => ? = 3
[1,0,1,1,0,1,1,1,0,0,0,0]
=> [(1,2),(3,12),(4,5),(6,11),(7,10),(8,9)]
=> [2,1,12,5,4,11,10,9,8,7,6,3] => [1,2,3,12,4,5,6,11,7,10,8,9] => ? = 3
[1,0,1,1,1,0,0,1,0,1,0,0]
=> [(1,2),(3,12),(4,7),(5,6),(8,9),(10,11)]
=> [2,1,12,7,6,5,4,9,8,11,10,3] => [1,2,3,12,4,7,5,6,8,9,10,11] => ? = 5
[1,0,1,1,1,1,0,0,0,1,0,0]
=> [(1,2),(3,12),(4,9),(5,8),(6,7),(10,11)]
=> [2,1,12,9,8,7,6,5,4,11,10,3] => [1,2,3,12,4,9,5,8,6,7,10,11] => ? = 3
[1,0,1,1,1,1,0,1,0,0,0,0]
=> [(1,2),(3,12),(4,11),(5,10),(6,7),(8,9)]
=> [2,1,12,11,10,7,6,9,8,5,4,3] => [1,2,3,12,4,11,5,10,6,7,8,9] => ? = 4
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [(1,4),(2,3),(5,6),(7,12),(8,9),(10,11)]
=> [4,3,2,1,6,5,12,9,8,11,10,7] => [1,4,2,3,5,6,7,12,8,9,10,11] => ? = 4
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [(1,4),(2,3),(5,8),(6,7),(9,12),(10,11)]
=> [4,3,2,1,8,7,6,5,12,11,10,9] => [1,4,2,3,5,8,6,7,9,12,10,11] => ? = 2
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [(1,4),(2,3),(5,10),(6,7),(8,9),(11,12)]
=> [4,3,2,1,10,7,6,9,8,5,12,11] => [1,4,2,3,5,10,6,7,8,9,11,12] => ? = 4
[1,1,0,0,1,1,1,0,0,1,0,0]
=> [(1,4),(2,3),(5,12),(6,9),(7,8),(10,11)]
=> [4,3,2,1,12,9,8,7,6,11,10,5] => [1,4,2,3,5,12,6,9,7,8,10,11] => ? = 3
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [(1,4),(2,3),(5,12),(6,11),(7,10),(8,9)]
=> [4,3,2,1,12,11,10,9,8,7,6,5] => [1,4,2,3,5,12,6,11,7,10,8,9] => ? = 2
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [(1,8),(2,3),(4,5),(6,7),(9,10),(11,12)]
=> [8,3,2,5,4,7,6,1,10,9,12,11] => [1,8,2,3,4,5,6,7,9,10,11,12] => ? = 6
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [(1,10),(2,3),(4,7),(5,6),(8,9),(11,12)]
=> [10,3,2,7,6,5,4,9,8,1,12,11] => [1,10,2,3,4,7,5,6,8,9,11,12] => ? = 3
[1,1,0,1,1,1,0,0,0,0,1,0]
=> [(1,10),(2,3),(4,9),(5,8),(6,7),(11,12)]
=> [10,3,2,9,8,7,6,5,4,1,12,11] => [1,10,2,3,4,9,5,8,6,7,11,12] => ? = 3
[1,1,1,0,0,0,1,1,0,1,0,0]
=> [(1,6),(2,5),(3,4),(7,12),(8,9),(10,11)]
=> [6,5,4,3,2,1,12,9,8,11,10,7] => [1,6,2,5,3,4,7,12,8,9,10,11] => ? = 4
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [(1,8),(2,5),(3,4),(6,7),(9,12),(10,11)]
=> [8,5,4,3,2,7,6,1,12,11,10,9] => [1,8,2,5,3,4,6,7,9,12,10,11] => ? = 3
[1,1,1,0,0,1,0,1,0,0,1,0]
=> [(1,10),(2,5),(3,4),(6,7),(8,9),(11,12)]
=> [10,5,4,3,2,7,6,9,8,1,12,11] => [1,10,2,5,3,4,6,7,8,9,11,12] => ? = 5
Description
The maximal number of nonzero entries on a diagonal of a permutation matrix. For example, the permutation matrix of $\pi=[3,1,2,5,4]$ is $$\begin{pmatrix} 0 & 1 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 & 0 \\ 1 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & 1 & 0 \end{pmatrix},$$ and the entries corresponding to $\pi_2=1$, $\pi_3=2$ and $\pi_5=4$ are all on the fourth diagonal from the right. In other words, this is $\max_k \lvert\{i: \pi_i-i = k\}\rvert$
Matching statistic: St000930
Mp00093: Dyck paths to binary wordBinary words
Mp00097: Binary words delta morphismInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St000930: Dyck paths ⟶ ℤResult quality: 11% values known / values provided: 11%distinct values known / distinct values provided: 50%
Values
[1,0]
=> 10 => [1,1] => [1,0,1,0]
=> 2
[1,0,1,0]
=> 1010 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,1,0,0]
=> 1100 => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,0,1,0,1,0]
=> 101010 => [1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6
[1,0,1,1,0,0]
=> 101100 => [1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,0,0,1,0]
=> 110010 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> 3
[1,1,0,1,0,0]
=> 110100 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> 4
[1,1,1,0,0,0]
=> 111000 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> 2
[1,0,1,0,1,0,1,0]
=> 10101010 => [1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 8
[1,0,1,0,1,1,0,0]
=> 10101100 => [1,1,1,1,2,2] => [1,0,1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> ? = 5
[1,0,1,1,0,0,1,0]
=> 10110010 => [1,1,2,2,1,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> ? = 3
[1,0,1,1,0,1,0,0]
=> 10110100 => [1,1,2,1,1,2] => [1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> ? = 4
[1,0,1,1,1,0,0,0]
=> 10111000 => [1,1,3,3] => [1,0,1,0,1,1,1,0,0,0,1,1,1,0,0,0]
=> ? = 3
[1,1,0,0,1,0,1,0]
=> 11001010 => [2,2,1,1,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> ? = 5
[1,1,0,0,1,1,0,0]
=> 11001100 => [2,2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> ? = 2
[1,1,0,1,0,0,1,0]
=> 11010010 => [2,1,1,2,1,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 4
[1,1,0,1,0,1,0,0]
=> 11010100 => [2,1,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> ? = 6
[1,1,0,1,1,0,0,0]
=> 11011000 => [2,1,2,3] => [1,1,0,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> ? = 3
[1,1,1,0,0,0,1,0]
=> 11100010 => [3,3,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 3
[1,1,1,0,0,1,0,0]
=> 11100100 => [3,2,1,2] => [1,1,1,0,0,0,1,1,0,0,1,0,1,1,0,0]
=> ? = 3
[1,1,1,0,1,0,0,0]
=> 11101000 => [3,1,1,3] => [1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0]
=> ? = 4
[1,1,1,1,0,0,0,0]
=> 11110000 => [4,4] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
=> ? = 2
[1,0,1,0,1,0,1,0,1,0]
=> 1010101010 => [1,1,1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 10
[1,0,1,0,1,1,0,0,1,0]
=> 1010110010 => [1,1,1,1,2,2,1,1] => [1,0,1,0,1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> ? = 5
[1,0,1,1,0,0,1,0,1,0]
=> 1011001010 => [1,1,2,2,1,1,1,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> ? = 5
[1,0,1,1,0,1,0,0,1,0]
=> 1011010010 => [1,1,2,1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 4
[1,0,1,1,1,0,0,0,1,0]
=> 1011100010 => [1,1,3,3,1,1] => [1,0,1,0,1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 3
[1,1,0,0,1,0,1,0,1,0]
=> 1100101010 => [2,2,1,1,1,1,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 7
[1,1,0,0,1,1,0,0,1,0]
=> 1100110010 => [2,2,2,2,1,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> ? = 3
[1,1,0,1,0,0,1,0,1,0]
=> 1101001010 => [2,1,1,2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> ? = 5
[1,1,0,1,0,1,0,0,1,0]
=> 1101010010 => [2,1,1,1,1,2,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 6
[1,1,0,1,1,0,0,0,1,0]
=> 1101100010 => [2,1,2,3,1,1] => [1,1,0,0,1,0,1,1,0,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 3
[1,1,1,0,0,0,1,0,1,0]
=> 1110001010 => [3,3,1,1,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> ? = 5
[1,1,1,0,0,1,0,0,1,0]
=> 1110010010 => [3,2,1,2,1,1] => [1,1,1,0,0,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 3
[1,1,1,0,1,0,0,0,1,0]
=> 1110100010 => [3,1,1,3,1,1] => [1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 4
[1,1,1,0,1,0,1,0,0,0]
=> 1110101000 => [3,1,1,1,1,3] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> ? = 6
[1,1,1,1,0,0,0,0,1,0]
=> 1111000010 => [4,4,1,1] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> 101011010100 => [1,1,1,1,2,1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> ? = 6
[1,0,1,1,0,0,1,1,0,1,0,0]
=> 101100110100 => [1,1,2,2,2,1,1,2] => [1,0,1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> ? = 4
[1,0,1,1,0,1,0,0,1,1,0,0]
=> 101101001100 => [1,1,2,1,1,2,2,2] => [1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> ? = 4
[1,0,1,1,0,1,0,1,0,0,1,0]
=> 101101010010 => [1,1,2,1,1,1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 6
[1,0,1,1,0,1,0,1,1,0,0,0]
=> 101101011000 => [1,1,2,1,1,1,2,3] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> ? = 5
[1,0,1,1,0,1,1,0,0,1,0,0]
=> 101101100100 => [1,1,2,1,2,2,1,2] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0,1,1,0,0,1,0,1,1,0,0]
=> ? = 3
[1,0,1,1,0,1,1,1,0,0,0,0]
=> 101101110000 => [1,1,2,1,3,4] => [1,0,1,0,1,1,0,0,1,0,1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> ? = 3
[1,0,1,1,1,0,0,1,0,1,0,0]
=> 101110010100 => [1,1,3,2,1,1,1,2] => [1,0,1,0,1,1,1,0,0,0,1,1,0,0,1,0,1,0,1,0,1,1,0,0]
=> ? = 5
[1,0,1,1,1,1,0,0,0,1,0,0]
=> 101111000100 => [1,1,4,3,1,2] => [1,0,1,0,1,1,1,1,0,0,0,0,1,1,1,0,0,0,1,0,1,1,0,0]
=> ? = 3
[1,0,1,1,1,1,0,1,0,0,0,0]
=> 101111010000 => [1,1,4,1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> ? = 4
[1,1,0,0,1,0,1,1,0,1,0,0]
=> 110010110100 => [2,2,1,1,2,1,1,2] => [1,1,0,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> ? = 4
[1,1,0,0,1,1,0,0,1,1,0,0]
=> 110011001100 => [2,2,2,2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> ? = 2
[1,1,0,0,1,1,0,1,0,0,1,0]
=> 110011010010 => [2,2,2,1,1,2,1,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 4
[1,1,0,0,1,1,1,0,0,1,0,0]
=> 110011100100 => [2,2,3,2,1,2] => [1,1,0,0,1,1,0,0,1,1,1,0,0,0,1,1,0,0,1,0,1,1,0,0]
=> ? = 3
[1,1,0,0,1,1,1,1,0,0,0,0]
=> 110011110000 => [2,2,4,4] => [1,1,0,0,1,1,0,0,1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
=> ? = 2
[1,1,0,1,0,1,0,0,1,0,1,0]
=> 110101001010 => [2,1,1,1,1,2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> ? = 6
[1,1,0,1,1,0,0,1,0,0,1,0]
=> 110110010010 => [2,1,2,2,1,2,1,1] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 3
[1,1,0,1,1,1,0,0,0,0,1,0]
=> 110111000010 => [2,1,3,4,1,1] => [1,1,0,0,1,0,1,1,1,0,0,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 3
[1,1,1,0,0,0,1,1,0,1,0,0]
=> 111000110100 => [3,3,2,1,1,2] => [1,1,1,0,0,0,1,1,1,0,0,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> ? = 4
[1,1,1,0,0,1,0,0,1,1,0,0]
=> 111001001100 => [3,2,1,2,2,2] => [1,1,1,0,0,0,1,1,0,0,1,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> ? = 3
[1,1,1,0,0,1,0,1,0,0,1,0]
=> 111001010010 => [3,2,1,1,1,2,1,1] => [1,1,1,0,0,0,1,1,0,0,1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> ? = 5
Description
The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. The $k$-Gorenstein degree is the maximal number $k$ such that the algebra is $k$-Gorenstein. We apply the convention that the value is equal to the global dimension of the algebra in case the $k$-Gorenstein degree is greater than or equal to the global dimension.
The following 11 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001530The depth of a Dyck path. St000519The largest length of a factor maximising the subword complexity. St000922The minimal number such that all substrings of this length are unique. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. 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. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001403The number of vertical separators in a permutation.