- FindStat

Identifier

Mp00104: Binary words —reverse⟶ Binary words
Mp00096: Binary words —Foata bijection⟶ Binary words
Mp00135: Binary words —rotate front-to-back⟶ Binary words

Images

0 => 0 => 0 => 0

1 => 1 => 1 => 1

00 => 00 => 00 => 00

01 => 10 => 10 => 01

10 => 01 => 01 => 10

11 => 11 => 11 => 11

000 => 000 => 000 => 000

001 => 100 => 010 => 100

010 => 010 => 100 => 001

011 => 110 => 110 => 101

100 => 001 => 001 => 010

101 => 101 => 101 => 011

110 => 011 => 011 => 110

111 => 111 => 111 => 111

0000 => 0000 => 0000 => 0000

0001 => 1000 => 0010 => 0100

0010 => 0100 => 0100 => 1000

0011 => 1100 => 0110 => 1100

0100 => 0010 => 1000 => 0001

0101 => 1010 => 1100 => 1001

0110 => 0110 => 1010 => 0101

0111 => 1110 => 1110 => 1101

1000 => 0001 => 0001 => 0010

1001 => 1001 => 0101 => 1010

1010 => 0101 => 1001 => 0011

1011 => 1101 => 1101 => 1011

1100 => 0011 => 0011 => 0110

1101 => 1011 => 1011 => 0111

1110 => 0111 => 0111 => 1110

1111 => 1111 => 1111 => 1111

00000 => 00000 => 00000 => 00000

00001 => 10000 => 00010 => 00100

00010 => 01000 => 00100 => 01000

00011 => 11000 => 00110 => 01100

00100 => 00100 => 01000 => 10000

00101 => 10100 => 01100 => 11000

00110 => 01100 => 01010 => 10100

00111 => 11100 => 01110 => 11100

01000 => 00010 => 10000 => 00001

01001 => 10010 => 10100 => 01001

01010 => 01010 => 11000 => 10001

01011 => 11010 => 11100 => 11001

01100 => 00110 => 10010 => 00101

01101 => 10110 => 11010 => 10101

01110 => 01110 => 10110 => 01101

01111 => 11110 => 11110 => 11101

10000 => 00001 => 00001 => 00010

10001 => 10001 => 00101 => 01010

10010 => 01001 => 01001 => 10010

10011 => 11001 => 01101 => 11010

10100 => 00101 => 10001 => 00011

10101 => 10101 => 11001 => 10011

10110 => 01101 => 10101 => 01011

10111 => 11101 => 11101 => 11011

11000 => 00011 => 00011 => 00110

11001 => 10011 => 01011 => 10110

11010 => 01011 => 10011 => 00111

11011 => 11011 => 11011 => 10111

11100 => 00111 => 00111 => 01110

11101 => 10111 => 10111 => 01111

11110 => 01111 => 01111 => 11110

11111 => 11111 => 11111 => 11111

000000 => 000000 => 000000 => 000000

000001 => 100000 => 000010 => 000100

000010 => 010000 => 000100 => 001000

000011 => 110000 => 000110 => 001100

000100 => 001000 => 001000 => 010000

000101 => 101000 => 001100 => 011000

000110 => 011000 => 001010 => 010100

000111 => 111000 => 001110 => 011100

001000 => 000100 => 010000 => 100000

001001 => 100100 => 010100 => 101000

001010 => 010100 => 011000 => 110000

001011 => 110100 => 011100 => 111000

001100 => 001100 => 010010 => 100100

001101 => 101100 => 011010 => 110100

001110 => 011100 => 010110 => 101100

001111 => 111100 => 011110 => 111100

010000 => 000010 => 100000 => 000001

010001 => 100010 => 100100 => 001001

010010 => 010010 => 101000 => 010001

010011 => 110010 => 101100 => 011001

010100 => 001010 => 110000 => 100001

010101 => 101010 => 111000 => 110001

010110 => 011010 => 110100 => 101001

010111 => 111010 => 111100 => 111001

011000 => 000110 => 100010 => 000101

011001 => 100110 => 101010 => 010101

011010 => 010110 => 110010 => 100101

011011 => 110110 => 111010 => 110101

011100 => 001110 => 100110 => 001101

011101 => 101110 => 110110 => 101101

011110 => 011110 => 101110 => 011101

011111 => 111110 => 111110 => 111101

100000 => 000001 => 000001 => 000010

100001 => 100001 => 000101 => 001010

100010 => 010001 => 001001 => 010010

100011 => 110001 => 001101 => 011010

100100 => 001001 => 010001 => 100010

100101 => 101001 => 011001 => 110010

100110 => 011001 => 010101 => 101010

>>> Load all 3152 entries. <<<

Map

reverse

Description

Return the reversal of a binary word.

Map

Foata bijection

Description

The Foata bijection $\phi$ is a bijection on the set of words of given content (by a slight generalization of Section 2 in [1]).
Given a word $w_1 w_2 ... w_n$, compute the image inductively by starting with $\phi(w_1) = w_1$. At the $i$-th step, if $\phi(w_1 w_2 ... w_i) = v_1 v_2 ... v_i$, define $\phi(w_1 w_2 ... w_i w_{i+1})$ by placing $w_{i+1}$ on the end of the word $v_1 v_2 ... v_i$ and breaking the word up into blocks as follows.

If $w_{i+1} \geq v_i$, place a vertical line to the right of each $v_k$ for which $w_{i+1} \geq v_k$.
If $w_{i+1} < v_i$, place a vertical line to the right of each $v_k$ for which $w_{i+1} < v_k$.

In either case, place a vertical line at the start of the word as well. Now, within each block between vertical lines, cyclically shift the entries one place to the right.
For instance, to compute $\phi(4154223)$, the sequence of words is

4,
|4|1 -- > 41,
|4|1|5 -- > 415,
|415|4 -- > 5414,
|5|4|14|2 -- > 54412,
|5441|2|2 -- > 154422,
|1|5442|2|3 -- > 1254423.

So $\phi(4154223) = 1254423$.

Map

rotate front-to-back

Description

The rotation of a binary word, first letter last.
This is the word obtained by moving the first letter to the end.