- FindStat

Identifier

Mp00105: Binary words —complement⟶ Binary words
Mp00096: Binary words —Foata bijection⟶ Binary words

Images

0 => 1 => 1

1 => 0 => 0

00 => 11 => 11

01 => 10 => 10

10 => 01 => 01

11 => 00 => 00

000 => 111 => 111

001 => 110 => 110

010 => 101 => 101

011 => 100 => 010

100 => 011 => 011

101 => 010 => 100

110 => 001 => 001

111 => 000 => 000

0000 => 1111 => 1111

0001 => 1110 => 1110

0010 => 1101 => 1101

0011 => 1100 => 0110

0100 => 1011 => 1011

0101 => 1010 => 1100

0110 => 1001 => 0101

0111 => 1000 => 0010

1000 => 0111 => 0111

1001 => 0110 => 1010

1010 => 0101 => 1001

1011 => 0100 => 0100

1100 => 0011 => 0011

1101 => 0010 => 1000

1110 => 0001 => 0001

1111 => 0000 => 0000

00000 => 11111 => 11111

00001 => 11110 => 11110

00010 => 11101 => 11101

00011 => 11100 => 01110

00100 => 11011 => 11011

00101 => 11010 => 11100

00110 => 11001 => 01101

00111 => 11000 => 00110

01000 => 10111 => 10111

01001 => 10110 => 11010

01010 => 10101 => 11001

01011 => 10100 => 01100

01100 => 10011 => 01011

01101 => 10010 => 10100

01110 => 10001 => 00101

01111 => 10000 => 00010

10000 => 01111 => 01111

10001 => 01110 => 10110

10010 => 01101 => 10101

10011 => 01100 => 01010

10100 => 01011 => 10011

10101 => 01010 => 11000

10110 => 01001 => 01001

10111 => 01000 => 00100

11000 => 00111 => 00111

11001 => 00110 => 10010

11010 => 00101 => 10001

11011 => 00100 => 01000

11100 => 00011 => 00011

11101 => 00010 => 10000

11110 => 00001 => 00001

11111 => 00000 => 00000

000000 => 111111 => 111111

000001 => 111110 => 111110

000010 => 111101 => 111101

000011 => 111100 => 011110

000100 => 111011 => 111011

000101 => 111010 => 111100

000110 => 111001 => 011101

000111 => 111000 => 001110

001000 => 110111 => 110111

001001 => 110110 => 111010

001010 => 110101 => 111001

001011 => 110100 => 011100

001100 => 110011 => 011011

001101 => 110010 => 101100

001110 => 110001 => 001101

001111 => 110000 => 000110

010000 => 101111 => 101111

010001 => 101110 => 110110

010010 => 101101 => 110101

010011 => 101100 => 011010

010100 => 101011 => 110011

010101 => 101010 => 111000

010110 => 101001 => 011001

010111 => 101000 => 001100

011000 => 100111 => 010111

011001 => 100110 => 101010

011010 => 100101 => 101001

011011 => 100100 => 010100

011100 => 100011 => 001011

011101 => 100010 => 100100

011110 => 100001 => 000101

011111 => 100000 => 000010

100000 => 011111 => 011111

100001 => 011110 => 101110

100010 => 011101 => 101101

100011 => 011100 => 010110

100100 => 011011 => 101011

100101 => 011010 => 110100

100110 => 011001 => 010101

>>> Load all 4287 entries. <<<

Map

complement

Description

Send a binary word to the word obtained by interchanging the two letters.

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$.