- FindStat

Identifier

Mp00280: Binary words —path rowmotion⟶ Binary words
Mp00105: Binary words —complement⟶ Binary words
Mp00280: Binary words —path rowmotion⟶ Binary words

Images

0 => 1 => 0 => 1

1 => 0 => 1 => 0

00 => 01 => 10 => 11

01 => 10 => 01 => 10

10 => 11 => 00 => 01

11 => 00 => 11 => 00

000 => 001 => 110 => 111

001 => 010 => 101 => 110

010 => 101 => 010 => 101

011 => 100 => 011 => 100

100 => 011 => 100 => 011

101 => 110 => 001 => 010

110 => 111 => 000 => 001

111 => 000 => 111 => 000

0000 => 0001 => 1110 => 1111

0001 => 0010 => 1101 => 1110

0010 => 0101 => 1010 => 1101

0011 => 0100 => 1011 => 1100

0100 => 1001 => 0110 => 1011

0101 => 1010 => 0101 => 1010

0110 => 1011 => 0100 => 1001

0111 => 1000 => 0111 => 1000

1000 => 0011 => 1100 => 0111

1001 => 0110 => 1001 => 0110

1010 => 1101 => 0010 => 0101

1011 => 1100 => 0011 => 0100

1100 => 0111 => 1000 => 0011

1101 => 1110 => 0001 => 0010

1110 => 1111 => 0000 => 0001

1111 => 0000 => 1111 => 0000

00000 => 00001 => 11110 => 11111

00001 => 00010 => 11101 => 11110

00010 => 00101 => 11010 => 11101

00011 => 00100 => 11011 => 11100

00100 => 01001 => 10110 => 11011

00101 => 01010 => 10101 => 11010

00110 => 01011 => 10100 => 11001

00111 => 01000 => 10111 => 11000

01000 => 10001 => 01110 => 10111

01001 => 10010 => 01101 => 10110

01010 => 10101 => 01010 => 10101

01011 => 10100 => 01011 => 10100

01100 => 10011 => 01100 => 10011

01101 => 10110 => 01001 => 10010

01110 => 10111 => 01000 => 10001

01111 => 10000 => 01111 => 10000

10000 => 00011 => 11100 => 01111

10001 => 00110 => 11001 => 01110

10010 => 01101 => 10010 => 01101

10011 => 01100 => 10011 => 01100

10100 => 11001 => 00110 => 01011

10101 => 11010 => 00101 => 01010

10110 => 11011 => 00100 => 01001

10111 => 11000 => 00111 => 01000

11000 => 00111 => 11000 => 00111

11001 => 01110 => 10001 => 00110

11010 => 11101 => 00010 => 00101

11011 => 11100 => 00011 => 00100

11100 => 01111 => 10000 => 00011

11101 => 11110 => 00001 => 00010

11110 => 11111 => 00000 => 00001

11111 => 00000 => 11111 => 00000

000000 => 000001 => 111110 => 111111

000001 => 000010 => 111101 => 111110

000010 => 000101 => 111010 => 111101

000011 => 000100 => 111011 => 111100

000100 => 001001 => 110110 => 111011

000101 => 001010 => 110101 => 111010

000110 => 001011 => 110100 => 111001

000111 => 001000 => 110111 => 111000

001000 => 010001 => 101110 => 110111

001001 => 010010 => 101101 => 110110

001010 => 010101 => 101010 => 110101

001011 => 010100 => 101011 => 110100

001100 => 010011 => 101100 => 110011

001101 => 010110 => 101001 => 110010

001110 => 010111 => 101000 => 110001

001111 => 010000 => 101111 => 110000

010000 => 100001 => 011110 => 101111

010001 => 100010 => 011101 => 101110

010010 => 100101 => 011010 => 101101

010011 => 100100 => 011011 => 101100

010100 => 101001 => 010110 => 101011

010101 => 101010 => 010101 => 101010

010110 => 101011 => 010100 => 101001

010111 => 101000 => 010111 => 101000

011000 => 100011 => 011100 => 100111

011001 => 100110 => 011001 => 100110

011010 => 101101 => 010010 => 100101

011011 => 101100 => 010011 => 100100

011100 => 100111 => 011000 => 100011

011101 => 101110 => 010001 => 100010

011110 => 101111 => 010000 => 100001

011111 => 100000 => 011111 => 100000

100000 => 000011 => 111100 => 011111

100001 => 000110 => 111001 => 011110

100010 => 001101 => 110010 => 011101

100011 => 001100 => 110011 => 011100

100100 => 011001 => 100110 => 011011

100101 => 011010 => 100101 => 011010

100110 => 011011 => 100100 => 011001

>>> Load all 1590 entries. <<<

Map

path rowmotion

Description

Return the rowmotion of the binary word, regarded as a lattice path.
Consider the binary word of length $n$ as a lattice path with $n$ steps, where a 1 corresponds to an up step and a 0 corresponds to a down step.
This map returns the path whose peaks are the valleys of the original path with an up step appended.

Map

complement

Description

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