Identifier
-
Mp00044:
Integer partitions
—conjugate⟶
Integer partitions
Mp00095: Integer partitions —to binary word⟶ Binary words
Mp00268: Binary words —zeros to flag zeros⟶ Binary words
St000983: Binary words ⟶ ℤ
Values
[1] => [1] => 10 => 01 => 2
[2] => [1,1] => 110 => 011 => 2
[1,1] => [2] => 100 => 101 => 3
[3] => [1,1,1] => 1110 => 0111 => 2
[2,1] => [2,1] => 1010 => 1001 => 2
[1,1,1] => [3] => 1000 => 0101 => 4
[4] => [1,1,1,1] => 11110 => 01111 => 2
[3,1] => [2,1,1] => 10110 => 10001 => 2
[2,2] => [2,2] => 1100 => 1011 => 3
[2,1,1] => [3,1] => 10010 => 01101 => 3
[1,1,1,1] => [4] => 10000 => 10101 => 5
[5] => [1,1,1,1,1] => 111110 => 011111 => 2
[4,1] => [2,1,1,1] => 101110 => 100001 => 2
[3,2] => [2,2,1] => 11010 => 10011 => 2
[3,1,1] => [3,1,1] => 100110 => 011101 => 3
[2,2,1] => [3,2] => 10100 => 01001 => 3
[2,1,1,1] => [4,1] => 100010 => 100101 => 4
[1,1,1,1,1] => [5] => 100000 => 010101 => 6
[6] => [1,1,1,1,1,1] => 1111110 => 0111111 => 2
[5,1] => [2,1,1,1,1] => 1011110 => 1000001 => 2
[4,2] => [2,2,1,1] => 110110 => 100011 => 2
[4,1,1] => [3,1,1,1] => 1001110 => 0111101 => 3
[3,3] => [2,2,2] => 11100 => 10111 => 3
[3,2,1] => [3,2,1] => 101010 => 011001 => 2
[3,1,1,1] => [4,1,1] => 1000110 => 1000101 => 4
[2,2,2] => [3,3] => 11000 => 01011 => 4
[2,2,1,1] => [4,2] => 100100 => 101101 => 3
[2,1,1,1,1] => [5,1] => 1000010 => 0110101 => 5
[1,1,1,1,1,1] => [6] => 1000000 => 1010101 => 7
[7] => [1,1,1,1,1,1,1] => 11111110 => 01111111 => 2
[6,1] => [2,1,1,1,1,1] => 10111110 => 10000001 => 2
[5,2] => [2,2,1,1,1] => 1101110 => 1000011 => 2
[5,1,1] => [3,1,1,1,1] => 10011110 => 01111101 => 3
[4,3] => [2,2,2,1] => 111010 => 100111 => 2
[4,2,1] => [3,2,1,1] => 1010110 => 0111001 => 2
[4,1,1,1] => [4,1,1,1] => 10001110 => 10000101 => 4
[3,3,1] => [3,2,2] => 101100 => 010001 => 3
[3,2,2] => [3,3,1] => 110010 => 011011 => 3
[3,2,1,1] => [4,2,1] => 1001010 => 1001101 => 3
[3,1,1,1,1] => [5,1,1] => 10000110 => 01110101 => 5
[2,2,2,1] => [4,3] => 101000 => 101001 => 4
[2,2,1,1,1] => [5,2] => 1000100 => 0100101 => 4
[2,1,1,1,1,1] => [6,1] => 10000010 => 10010101 => 6
[1,1,1,1,1,1,1] => [7] => 10000000 => 01010101 => 8
[8] => [1,1,1,1,1,1,1,1] => 111111110 => 011111111 => 2
[7,1] => [2,1,1,1,1,1,1] => 101111110 => 100000001 => 2
[6,2] => [2,2,1,1,1,1] => 11011110 => 10000011 => 2
[6,1,1] => [3,1,1,1,1,1] => 100111110 => 011111101 => 3
[5,3] => [2,2,2,1,1] => 1110110 => 1000111 => 2
[5,2,1] => [3,2,1,1,1] => 10101110 => 01111001 => 2
[5,1,1,1] => [4,1,1,1,1] => 100011110 => 100000101 => 4
[4,4] => [2,2,2,2] => 111100 => 101111 => 3
[4,3,1] => [3,2,2,1] => 1011010 => 0110001 => 2
[4,2,2] => [3,3,1,1] => 1100110 => 0111011 => 3
[4,2,1,1] => [4,2,1,1] => 10010110 => 10001101 => 3
[4,1,1,1,1] => [5,1,1,1] => 100001110 => 011110101 => 5
[3,3,2] => [3,3,2] => 110100 => 010011 => 3
[3,3,1,1] => [4,2,2] => 1001100 => 1011101 => 3
[3,2,2,1] => [4,3,1] => 1010010 => 1001001 => 3
[3,2,1,1,1] => [5,2,1] => 10001010 => 01100101 => 4
[3,1,1,1,1,1] => [6,1,1] => 100000110 => 100010101 => 6
[2,2,2,2] => [4,4] => 110000 => 101011 => 5
[2,2,2,1,1] => [5,3] => 1001000 => 0101101 => 4
[2,2,1,1,1,1] => [6,2] => 10000100 => 10110101 => 5
[2,1,1,1,1,1,1] => [7,1] => 100000010 => 011010101 => 7
[1,1,1,1,1,1,1,1] => [8] => 100000000 => 101010101 => 9
[7,2] => [2,2,1,1,1,1,1] => 110111110 => 100000011 => 2
[6,3] => [2,2,2,1,1,1] => 11101110 => 10000111 => 2
[6,2,1] => [3,2,1,1,1,1] => 101011110 => 011111001 => 2
[5,4] => [2,2,2,2,1] => 1111010 => 1001111 => 2
[5,3,1] => [3,2,2,1,1] => 10110110 => 01110001 => 2
[5,2,2] => [3,3,1,1,1] => 11001110 => 01111011 => 3
[5,2,1,1] => [4,2,1,1,1] => 100101110 => 100001101 => 3
[4,4,1] => [3,2,2,2] => 1011100 => 0100001 => 3
[4,3,2] => [3,3,2,1] => 1101010 => 0110011 => 2
[4,3,1,1] => [4,2,2,1] => 10011010 => 10011101 => 3
[4,2,2,1] => [4,3,1,1] => 10100110 => 10001001 => 3
[4,2,1,1,1] => [5,2,1,1] => 100010110 => 011100101 => 4
[3,3,3] => [3,3,3] => 111000 => 010111 => 4
[3,3,2,1] => [4,3,2] => 1010100 => 1011001 => 3
[3,3,1,1,1] => [5,2,2] => 10001100 => 01000101 => 4
[3,2,2,2] => [4,4,1] => 1100010 => 1001011 => 4
[3,2,2,1,1] => [5,3,1] => 10010010 => 01101101 => 3
[3,2,1,1,1,1] => [6,2,1] => 100001010 => 100110101 => 5
[2,2,2,2,1] => [5,4] => 1010000 => 0101001 => 5
[2,2,2,1,1,1] => [6,3] => 10001000 => 10100101 => 4
[2,2,1,1,1,1,1] => [7,2] => 100000100 => 010010101 => 6
[7,3] => [2,2,2,1,1,1,1] => 111011110 => 100000111 => 2
[6,4] => [2,2,2,2,1,1] => 11110110 => 10001111 => 2
[6,3,1] => [3,2,2,1,1,1] => 101101110 => 011110001 => 2
[6,2,2] => [3,3,1,1,1,1] => 110011110 => 011111011 => 3
[5,5] => [2,2,2,2,2] => 1111100 => 1011111 => 3
[5,4,1] => [3,2,2,2,1] => 10111010 => 01100001 => 2
[5,3,2] => [3,3,2,1,1] => 11010110 => 01110011 => 2
[5,3,1,1] => [4,2,2,1,1] => 100110110 => 100011101 => 3
[5,2,2,1] => [4,3,1,1,1] => 101001110 => 100001001 => 3
[4,4,2] => [3,3,2,2] => 1101100 => 0100011 => 3
[4,4,1,1] => [4,2,2,2] => 10011100 => 10111101 => 3
[4,3,3] => [3,3,3,1] => 1110010 => 0110111 => 3
[4,3,2,1] => [4,3,2,1] => 10101010 => 10011001 => 2
[4,3,1,1,1] => [5,2,2,1] => 100011010 => 011000101 => 4
>>> Load all 250 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 length of the longest alternating subword.
This is the length of the longest consecutive subword of the form $010...$ or of the form $101...$.
This is the length of the longest consecutive subword of the form $010...$ or of the form $101...$.
Map
zeros to flag zeros
Description
Return a binary word of the same length, such that the number of occurrences of $10$ in the word obtained by prepending the reverse of the complement equals the number of $0$s in the original word.
For example, the image of the word $w=1\dots1$ is $1\dots1$, because $w$ has no zeros, and $1\dots1$ is the only word such that prepending the reverse of its complement has no occurrence of the factor $10$.
On the other hand, $0\dots0$ must be mapped to $10\dots10$ if the length is even, and $010\dots10$ if it is odd.
For example, the image of the word $w=1\dots1$ is $1\dots1$, because $w$ has no zeros, and $1\dots1$ is the only word such that prepending the reverse of its complement has no occurrence of the factor $10$.
On the other hand, $0\dots0$ must be mapped to $10\dots10$ if the length is even, and $010\dots10$ if it is odd.
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.
Map
conjugate
Description
Return the conjugate partition of the partition.
The conjugate partition of the partition $\lambda$ of $n$ is the partition $\lambda^*$ whose Ferrers diagram is obtained from the diagram of $\lambda$ by interchanging rows with columns.
This is also called the associated partition or the transpose in the literature.
The conjugate partition of the partition $\lambda$ of $n$ is the partition $\lambda^*$ whose Ferrers diagram is obtained from the diagram of $\lambda$ by interchanging rows with columns.
This is also called the associated partition or the transpose in the literature.
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!