- FindStat

Identifier

Mp00134: Standard tableaux —descent word⟶ Binary words
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00094: Integer compositions —to binary word⟶ Binary words
St000288: Binary words ⟶ ℤ

Values

[[1]] => => [1] => 1 => 1

[[1,2]] => 0 => [2] => 10 => 1

[[1],[2]] => 1 => [1,1] => 11 => 2

[[1,2,3]] => 00 => [3] => 100 => 1

[[1,3],[2]] => 10 => [1,2] => 110 => 2

[[1,2],[3]] => 01 => [2,1] => 101 => 2

[[1],[2],[3]] => 11 => [1,1,1] => 111 => 3

[[1,2,3,4]] => 000 => [4] => 1000 => 1

[[1,3,4],[2]] => 100 => [1,3] => 1100 => 2

[[1,2,4],[3]] => 010 => [2,2] => 1010 => 2

[[1,2,3],[4]] => 001 => [3,1] => 1001 => 2

[[1,3],[2,4]] => 101 => [1,2,1] => 1101 => 3

[[1,2],[3,4]] => 010 => [2,2] => 1010 => 2

[[1,4],[2],[3]] => 110 => [1,1,2] => 1110 => 3

[[1,3],[2],[4]] => 101 => [1,2,1] => 1101 => 3

[[1,2],[3],[4]] => 011 => [2,1,1] => 1011 => 3

[[1],[2],[3],[4]] => 111 => [1,1,1,1] => 1111 => 4

[[1,2,3,4,5]] => 0000 => [5] => 10000 => 1

[[1,3,4,5],[2]] => 1000 => [1,4] => 11000 => 2

[[1,2,4,5],[3]] => 0100 => [2,3] => 10100 => 2

[[1,2,3,5],[4]] => 0010 => [3,2] => 10010 => 2

[[1,2,3,4],[5]] => 0001 => [4,1] => 10001 => 2

[[1,3,5],[2,4]] => 1010 => [1,2,2] => 11010 => 3

[[1,2,5],[3,4]] => 0100 => [2,3] => 10100 => 2

[[1,3,4],[2,5]] => 1001 => [1,3,1] => 11001 => 3

[[1,2,4],[3,5]] => 0101 => [2,2,1] => 10101 => 3

[[1,2,3],[4,5]] => 0010 => [3,2] => 10010 => 2

[[1,4,5],[2],[3]] => 1100 => [1,1,3] => 11100 => 3

[[1,3,5],[2],[4]] => 1010 => [1,2,2] => 11010 => 3

[[1,2,5],[3],[4]] => 0110 => [2,1,2] => 10110 => 3

[[1,3,4],[2],[5]] => 1001 => [1,3,1] => 11001 => 3

[[1,2,4],[3],[5]] => 0101 => [2,2,1] => 10101 => 3

[[1,2,3],[4],[5]] => 0011 => [3,1,1] => 10011 => 3

[[1,4],[2,5],[3]] => 1101 => [1,1,2,1] => 11101 => 4

[[1,3],[2,5],[4]] => 1010 => [1,2,2] => 11010 => 3

[[1,2],[3,5],[4]] => 0110 => [2,1,2] => 10110 => 3

[[1,3],[2,4],[5]] => 1011 => [1,2,1,1] => 11011 => 4

[[1,2],[3,4],[5]] => 0101 => [2,2,1] => 10101 => 3

[[1,5],[2],[3],[4]] => 1110 => [1,1,1,2] => 11110 => 4

[[1,4],[2],[3],[5]] => 1101 => [1,1,2,1] => 11101 => 4

[[1,3],[2],[4],[5]] => 1011 => [1,2,1,1] => 11011 => 4

[[1,2],[3],[4],[5]] => 0111 => [2,1,1,1] => 10111 => 4

[[1],[2],[3],[4],[5]] => 1111 => [1,1,1,1,1] => 11111 => 5

[[1,2,3,4,5,6]] => 00000 => [6] => 100000 => 1

[[1,3,4,5,6],[2]] => 10000 => [1,5] => 110000 => 2

[[1,2,4,5,6],[3]] => 01000 => [2,4] => 101000 => 2

[[1,2,3,5,6],[4]] => 00100 => [3,3] => 100100 => 2

[[1,2,3,4,6],[5]] => 00010 => [4,2] => 100010 => 2

[[1,2,3,4,5],[6]] => 00001 => [5,1] => 100001 => 2

[[1,3,5,6],[2,4]] => 10100 => [1,2,3] => 110100 => 3

[[1,2,5,6],[3,4]] => 01000 => [2,4] => 101000 => 2

[[1,3,4,6],[2,5]] => 10010 => [1,3,2] => 110010 => 3

[[1,2,4,6],[3,5]] => 01010 => [2,2,2] => 101010 => 3

[[1,2,3,6],[4,5]] => 00100 => [3,3] => 100100 => 2

[[1,3,4,5],[2,6]] => 10001 => [1,4,1] => 110001 => 3

[[1,2,4,5],[3,6]] => 01001 => [2,3,1] => 101001 => 3

[[1,2,3,5],[4,6]] => 00101 => [3,2,1] => 100101 => 3

[[1,2,3,4],[5,6]] => 00010 => [4,2] => 100010 => 2

[[1,4,5,6],[2],[3]] => 11000 => [1,1,4] => 111000 => 3

[[1,3,5,6],[2],[4]] => 10100 => [1,2,3] => 110100 => 3

[[1,2,5,6],[3],[4]] => 01100 => [2,1,3] => 101100 => 3

[[1,3,4,6],[2],[5]] => 10010 => [1,3,2] => 110010 => 3

[[1,2,4,6],[3],[5]] => 01010 => [2,2,2] => 101010 => 3

[[1,2,3,6],[4],[5]] => 00110 => [3,1,2] => 100110 => 3

[[1,3,4,5],[2],[6]] => 10001 => [1,4,1] => 110001 => 3

[[1,2,4,5],[3],[6]] => 01001 => [2,3,1] => 101001 => 3

[[1,2,3,5],[4],[6]] => 00101 => [3,2,1] => 100101 => 3

[[1,2,3,4],[5],[6]] => 00011 => [4,1,1] => 100011 => 3

[[1,3,5],[2,4,6]] => 10101 => [1,2,2,1] => 110101 => 4

[[1,2,5],[3,4,6]] => 01001 => [2,3,1] => 101001 => 3

[[1,3,4],[2,5,6]] => 10010 => [1,3,2] => 110010 => 3

[[1,2,4],[3,5,6]] => 01010 => [2,2,2] => 101010 => 3

[[1,2,3],[4,5,6]] => 00100 => [3,3] => 100100 => 2

[[1,4,6],[2,5],[3]] => 11010 => [1,1,2,2] => 111010 => 4

[[1,3,6],[2,5],[4]] => 10100 => [1,2,3] => 110100 => 3

[[1,2,6],[3,5],[4]] => 01100 => [2,1,3] => 101100 => 3

[[1,3,6],[2,4],[5]] => 10110 => [1,2,1,2] => 110110 => 4

[[1,2,6],[3,4],[5]] => 01010 => [2,2,2] => 101010 => 3

[[1,4,5],[2,6],[3]] => 11001 => [1,1,3,1] => 111001 => 4

[[1,3,5],[2,6],[4]] => 10101 => [1,2,2,1] => 110101 => 4

[[1,2,5],[3,6],[4]] => 01101 => [2,1,2,1] => 101101 => 4

[[1,3,4],[2,6],[5]] => 10010 => [1,3,2] => 110010 => 3

[[1,2,4],[3,6],[5]] => 01010 => [2,2,2] => 101010 => 3

[[1,2,3],[4,6],[5]] => 00110 => [3,1,2] => 100110 => 3

[[1,3,5],[2,4],[6]] => 10101 => [1,2,2,1] => 110101 => 4

[[1,2,5],[3,4],[6]] => 01001 => [2,3,1] => 101001 => 3

[[1,3,4],[2,5],[6]] => 10011 => [1,3,1,1] => 110011 => 4

[[1,2,4],[3,5],[6]] => 01011 => [2,2,1,1] => 101011 => 4

[[1,2,3],[4,5],[6]] => 00101 => [3,2,1] => 100101 => 3

[[1,5,6],[2],[3],[4]] => 11100 => [1,1,1,3] => 111100 => 4

[[1,4,6],[2],[3],[5]] => 11010 => [1,1,2,2] => 111010 => 4

[[1,3,6],[2],[4],[5]] => 10110 => [1,2,1,2] => 110110 => 4

[[1,2,6],[3],[4],[5]] => 01110 => [2,1,1,2] => 101110 => 4

[[1,4,5],[2],[3],[6]] => 11001 => [1,1,3,1] => 111001 => 4

[[1,3,5],[2],[4],[6]] => 10101 => [1,2,2,1] => 110101 => 4

[[1,2,5],[3],[4],[6]] => 01101 => [2,1,2,1] => 101101 => 4

[[1,3,4],[2],[5],[6]] => 10011 => [1,3,1,1] => 110011 => 4

[[1,2,4],[3],[5],[6]] => 01011 => [2,2,1,1] => 101011 => 4

[[1,2,3],[4],[5],[6]] => 00111 => [3,1,1,1] => 100111 => 4

[[1,4],[2,5],[3,6]] => 11011 => [1,1,2,1,1] => 111011 => 5

[[1,3],[2,5],[4,6]] => 10101 => [1,2,2,1] => 110101 => 4

>>> Load all 1496 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

click to show known generating functions

Description

The number of ones in a binary word.
This is also known as the Hamming weight of the word.

Map

to composition

Description

The composition corresponding to a binary word.
Prepending $1$ to a binary word $w$, the $i$-th part of the composition equals $1$ plus the number of zeros after the $i$-th $1$ in $w$.
This map is not surjective, since the empty composition does not have a preimage.

Map

to binary word

Description

Return the composition as a binary word, treating ones as separators.
Encoding a positive integer $i$ as the word $10\dots 0$ consisting of a one followed by $i-1$ zeros, the binary word of a composition $(i_1,\dots,i_k)$ is the concatenation of of words for $i_1,\dots,i_k$.
The image of this map contains precisely the words which do not begin with a $0$.

Map

descent word

Description

The descent word of a standard Young tableau.
For a standard Young tableau of size $n$ we set $w_i=1$ if $i+1$ is in a lower row than $i$, and $0$ otherwise, for $1\leq i < n$.