Identifier
-
Mp00095:
Integer partitions
—to binary word⟶
Binary words
Mp00261: Binary words —Burrows-Wheeler⟶ Binary words
St000291: Binary words ⟶ ℤ
Values
[1] => 10 => 10 => 1
[2] => 100 => 100 => 1
[1,1] => 110 => 110 => 1
[3] => 1000 => 1000 => 1
[2,1] => 1010 => 1100 => 1
[1,1,1] => 1110 => 1110 => 1
[4] => 10000 => 10000 => 1
[3,1] => 10010 => 11000 => 1
[2,2] => 1100 => 1010 => 2
[2,1,1] => 10110 => 11100 => 1
[1,1,1,1] => 11110 => 11110 => 1
[5] => 100000 => 100000 => 1
[4,1] => 100010 => 101000 => 2
[3,2] => 10100 => 11000 => 1
[3,1,1] => 100110 => 110010 => 2
[2,2,1] => 11010 => 11100 => 1
[2,1,1,1] => 101110 => 111010 => 2
[1,1,1,1,1] => 111110 => 111110 => 1
[6] => 1000000 => 1000000 => 1
[5,1] => 1000010 => 1001000 => 2
[4,2] => 100100 => 110000 => 1
[4,1,1] => 1000110 => 1010010 => 3
[3,3] => 11000 => 10010 => 2
[3,2,1] => 101010 => 111000 => 1
[3,1,1,1] => 1001110 => 1100110 => 2
[2,2,2] => 11100 => 10110 => 2
[2,2,1,1] => 110110 => 111100 => 1
[2,1,1,1,1] => 1011110 => 1110110 => 2
[1,1,1,1,1,1] => 1111110 => 1111110 => 1
[7] => 10000000 => 10000000 => 1
[6,1] => 10000010 => 10001000 => 2
[5,2] => 1000100 => 1100000 => 1
[5,1,1] => 10000110 => 10010010 => 3
[4,3] => 101000 => 101000 => 2
[4,2,1] => 1001010 => 1110000 => 1
[4,1,1,1] => 10001110 => 10100110 => 3
[3,3,1] => 110010 => 101100 => 2
[3,2,2] => 101100 => 101100 => 2
[3,2,1,1] => 1010110 => 1111000 => 1
[3,1,1,1,1] => 10011110 => 11001110 => 2
[2,2,2,1] => 111010 => 111010 => 2
[2,2,1,1,1] => 1101110 => 1111100 => 1
[2,1,1,1,1,1] => 10111110 => 11101110 => 2
[1,1,1,1,1,1,1] => 11111110 => 11111110 => 1
[8] => 100000000 => 100000000 => 1
[7,1] => 100000010 => 100001000 => 2
[6,2] => 10000100 => 10100000 => 2
[6,1,1] => 100000110 => 100010010 => 3
[5,3] => 1001000 => 1100000 => 1
[5,2,1] => 10001010 => 10110000 => 2
[5,1,1,1] => 100001110 => 100100110 => 3
[4,4] => 110000 => 100010 => 2
[4,3,1] => 1010010 => 1110000 => 1
[4,2,2] => 1001100 => 1100100 => 2
[4,2,1,1] => 10010110 => 11010100 => 3
[4,1,1,1,1] => 100011110 => 101001110 => 3
[3,3,2] => 110100 => 110010 => 2
[3,3,1,1] => 1100110 => 1101100 => 2
[3,2,2,1] => 1011010 => 1111000 => 1
[3,2,1,1,1] => 10101110 => 11110010 => 2
[3,1,1,1,1,1] => 100111110 => 110011110 => 2
[2,2,2,2] => 111100 => 101110 => 2
[2,2,2,1,1] => 1110110 => 1111100 => 1
[2,2,1,1,1,1] => 11011110 => 11111010 => 2
[2,1,1,1,1,1,1] => 101111110 => 111011110 => 2
[1,1,1,1,1,1,1,1] => 111111110 => 111111110 => 1
[9] => 1000000000 => 1000000000 => 1
[7,2] => 100000100 => 100100000 => 2
[6,3] => 10001000 => 11000000 => 1
[6,2,1] => 100001010 => 100110000 => 2
[5,4] => 1010000 => 1001000 => 2
[5,3,1] => 10010010 => 11100000 => 1
[5,2,2] => 10001100 => 11000010 => 2
[5,2,1,1] => 100010110 => 101010100 => 4
[5,1,1,1,1] => 1000011110 => 1001001110 => 3
[4,4,1] => 1100010 => 1001100 => 2
[4,3,2] => 1010100 => 1110000 => 1
[4,3,1,1] => 10100110 => 11100010 => 2
[4,2,2,1] => 10011010 => 11100010 => 2
[4,2,1,1,1] => 100101110 => 110101010 => 4
[3,3,3] => 111000 => 100110 => 2
[3,3,2,1] => 1101010 => 1111000 => 1
[3,3,1,1,1] => 11001110 => 11011010 => 3
[3,2,2,2] => 1011100 => 1011010 => 3
[3,2,2,1,1] => 10110110 => 11111000 => 1
[3,2,1,1,1,1] => 101011110 => 111100110 => 2
[2,2,2,2,1] => 1111010 => 1110110 => 2
[2,2,2,1,1,1] => 11101110 => 11111100 => 1
[2,2,1,1,1,1,1] => 110111110 => 111110110 => 2
[2,1,1,1,1,1,1,1] => 1011111110 => 1110111110 => 2
[1,1,1,1,1,1,1,1,1] => 1111111110 => 1111111110 => 1
[10] => 10000000000 => 10000000000 => 1
[7,3] => 100001000 => 110000000 => 1
[6,4] => 10010000 => 10100000 => 2
[6,3,1] => 100010010 => 101100000 => 2
[6,2,2] => 100001100 => 101000010 => 3
[5,5] => 1100000 => 1000010 => 2
[5,4,1] => 10100010 => 10110000 => 2
[5,3,2] => 10010100 => 11100000 => 1
[5,3,1,1] => 100100110 => 111000010 => 2
[5,2,2,1] => 100011010 => 101100010 => 3
>>> Load all 287 entries. <<<
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
Description
The number of descents of a binary word.
Map
Burrows-Wheeler
Description
The Burrows-Wheeler transform of a binary word.
The Burrows-Wheeler transform of a finite word $w$ is obtained from $w$ by first listing the conjugates of $w$ in lexicographic order and then concatenating the final letters of the conjugates in this order.
The Burrows-Wheeler transform of a finite word $w$ is obtained from $w$ by first listing the conjugates of $w$ in lexicographic order and then concatenating the final letters of the conjugates in this order.
Map
to binary word
Description
Return the partition as binary word, by traversing its shape from the first row to the last row, down steps as 1 and left steps as 0.
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!