- FindStat

Identifier

Mp00234: Binary words —valleys-to-peaks⟶ Binary words
Mp00261: Binary words —Burrows-Wheeler⟶ Binary words
St000297: Binary words ⟶ ℤ

Values

0 => 1 => 1 => 1

1 => 1 => 1 => 1

00 => 01 => 10 => 1

01 => 10 => 10 => 1

10 => 11 => 11 => 2

11 => 11 => 11 => 2

000 => 001 => 100 => 1

001 => 010 => 100 => 1

010 => 101 => 110 => 2

011 => 101 => 110 => 2

100 => 101 => 110 => 2

101 => 110 => 110 => 2

110 => 111 => 111 => 3

111 => 111 => 111 => 3

0000 => 0001 => 1000 => 1

0001 => 0010 => 1000 => 1

0010 => 0101 => 1100 => 2

0011 => 0101 => 1100 => 2

0100 => 1001 => 1010 => 1

0101 => 1010 => 1100 => 2

0110 => 1011 => 1110 => 3

0111 => 1011 => 1110 => 3

1000 => 1001 => 1010 => 1

1001 => 1010 => 1100 => 2

1010 => 1101 => 1110 => 3

1011 => 1101 => 1110 => 3

1100 => 1101 => 1110 => 3

1101 => 1110 => 1110 => 3

1110 => 1111 => 1111 => 4

1111 => 1111 => 1111 => 4

00000 => 00001 => 10000 => 1

00001 => 00010 => 10000 => 1

00010 => 00101 => 11000 => 2

00011 => 00101 => 11000 => 2

00100 => 01001 => 11000 => 2

00101 => 01010 => 11000 => 2

00110 => 01011 => 11100 => 3

00111 => 01011 => 11100 => 3

01000 => 10001 => 10010 => 1

01001 => 10010 => 11000 => 2

01010 => 10101 => 11100 => 3

01011 => 10101 => 11100 => 3

01100 => 10101 => 11100 => 3

01101 => 10110 => 11100 => 3

01110 => 10111 => 11110 => 4

01111 => 10111 => 11110 => 4

10000 => 10001 => 10010 => 1

10001 => 10010 => 11000 => 2

10010 => 10101 => 11100 => 3

10011 => 10101 => 11100 => 3

10100 => 11001 => 10110 => 1

10101 => 11010 => 11100 => 3

10110 => 11011 => 11110 => 4

10111 => 11011 => 11110 => 4

11000 => 11001 => 10110 => 1

11001 => 11010 => 11100 => 3

11010 => 11101 => 11110 => 4

11011 => 11101 => 11110 => 4

11100 => 11101 => 11110 => 4

11101 => 11110 => 11110 => 4

11110 => 11111 => 11111 => 5

11111 => 11111 => 11111 => 5

000000 => 000001 => 100000 => 1

000001 => 000010 => 100000 => 1

000010 => 000101 => 101000 => 1

000011 => 000101 => 101000 => 1

000100 => 001001 => 110000 => 2

000101 => 001010 => 101000 => 1

000110 => 001011 => 101100 => 1

000111 => 001011 => 101100 => 1

001000 => 010001 => 101000 => 1

001001 => 010010 => 110000 => 2

001010 => 010101 => 111000 => 3

001011 => 010101 => 111000 => 3

001100 => 010101 => 111000 => 3

001101 => 010110 => 101100 => 1

001110 => 010111 => 111010 => 3

001111 => 010111 => 111010 => 3

010000 => 100001 => 100010 => 1

010001 => 100010 => 101000 => 1

010010 => 100101 => 101100 => 1

010011 => 100101 => 101100 => 1

010100 => 101001 => 110010 => 2

010101 => 101010 => 111000 => 3

010110 => 101011 => 111010 => 3

010111 => 101011 => 111010 => 3

011000 => 101001 => 110010 => 2

011001 => 101010 => 111000 => 3

011010 => 101101 => 111100 => 4

011011 => 101101 => 111100 => 4

011100 => 101101 => 111100 => 4

011101 => 101110 => 111010 => 3

011110 => 101111 => 111110 => 5

011111 => 101111 => 111110 => 5

100000 => 100001 => 100010 => 1

100001 => 100010 => 101000 => 1

100010 => 100101 => 101100 => 1

100011 => 100101 => 101100 => 1

100100 => 101001 => 110010 => 2

100101 => 101010 => 111000 => 3

100110 => 101011 => 111010 => 3

>>> Load all 1284 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 leading ones in a binary word.

Map

valleys-to-peaks

Description

Return the binary word with every valley replaced by a peak.
A valley in a binary word is a subsequence $01$, or a trailing $0$. A peak is a subsequence $10$ or a trailing $1$. This map replaces every valley with a peak.

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.