- FindStat

Identifier

Mp00017: Binary trees —to 312-avoiding permutation⟶ Permutations
Mp00109: Permutations —descent word⟶ Binary words
Mp00104: Binary words —reverse⟶ Binary words

Images

[.,.] => [1] => =>

[.,[.,.]] => [2,1] => 1 => 1

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

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

[.,[[.,.],.]] => [2,3,1] => 01 => 10

[[.,.],[.,.]] => [1,3,2] => 01 => 10

[[.,[.,.]],.] => [2,1,3] => 10 => 01

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

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

[.,[.,[[.,.],.]]] => [3,4,2,1] => 011 => 110

[.,[[.,.],[.,.]]] => [2,4,3,1] => 011 => 110

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

[.,[[[.,.],.],.]] => [2,3,4,1] => 001 => 100

[[.,.],[.,[.,.]]] => [1,4,3,2] => 011 => 110

[[.,.],[[.,.],.]] => [1,3,4,2] => 001 => 100

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

[[[.,.],.],[.,.]] => [1,2,4,3] => 001 => 100

[[.,[.,[.,.]]],.] => [3,2,1,4] => 110 => 011

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

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

[[[.,[.,.]],.],.] => [2,1,3,4] => 100 => 001

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

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

[.,[.,[.,[[.,.],.]]]] => [4,5,3,2,1] => 0111 => 1110

[.,[.,[[.,.],[.,.]]]] => [3,5,4,2,1] => 0111 => 1110

[.,[.,[[.,[.,.]],.]]] => [4,3,5,2,1] => 1011 => 1101

[.,[.,[[[.,.],.],.]]] => [3,4,5,2,1] => 0011 => 1100

[.,[[.,.],[.,[.,.]]]] => [2,5,4,3,1] => 0111 => 1110

[.,[[.,.],[[.,.],.]]] => [2,4,5,3,1] => 0011 => 1100

[.,[[.,[.,.]],[.,.]]] => [3,2,5,4,1] => 1011 => 1101

[.,[[[.,.],.],[.,.]]] => [2,3,5,4,1] => 0011 => 1100

[.,[[.,[.,[.,.]]],.]] => [4,3,2,5,1] => 1101 => 1011

[.,[[.,[[.,.],.]],.]] => [3,4,2,5,1] => 0101 => 1010

[.,[[[.,.],[.,.]],.]] => [2,4,3,5,1] => 0101 => 1010

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

[.,[[[[.,.],.],.],.]] => [2,3,4,5,1] => 0001 => 1000

[[.,.],[.,[.,[.,.]]]] => [1,5,4,3,2] => 0111 => 1110

[[.,.],[.,[[.,.],.]]] => [1,4,5,3,2] => 0011 => 1100

[[.,.],[[.,.],[.,.]]] => [1,3,5,4,2] => 0011 => 1100

[[.,.],[[.,[.,.]],.]] => [1,4,3,5,2] => 0101 => 1010

[[.,.],[[[.,.],.],.]] => [1,3,4,5,2] => 0001 => 1000

[[.,[.,.]],[.,[.,.]]] => [2,1,5,4,3] => 1011 => 1101

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

[[[.,.],.],[.,[.,.]]] => [1,2,5,4,3] => 0011 => 1100

[[[.,.],.],[[.,.],.]] => [1,2,4,5,3] => 0001 => 1000

[[.,[.,[.,.]]],[.,.]] => [3,2,1,5,4] => 1101 => 1011

[[.,[[.,.],.]],[.,.]] => [2,3,1,5,4] => 0101 => 1010

[[[.,.],[.,.]],[.,.]] => [1,3,2,5,4] => 0101 => 1010

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

[[[[.,.],.],.],[.,.]] => [1,2,3,5,4] => 0001 => 1000

[[.,[.,[.,[.,.]]]],.] => [4,3,2,1,5] => 1110 => 0111

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

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

[[.,[[.,[.,.]],.]],.] => [3,2,4,1,5] => 1010 => 0101

[[.,[[[.,.],.],.]],.] => [2,3,4,1,5] => 0010 => 0100

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

[[[.,.],[[.,.],.]],.] => [1,3,4,2,5] => 0010 => 0100

[[[.,[.,.]],[.,.]],.] => [2,1,4,3,5] => 1010 => 0101

[[[[.,.],.],[.,.]],.] => [1,2,4,3,5] => 0010 => 0100

[[[.,[.,[.,.]]],.],.] => [3,2,1,4,5] => 1100 => 0011

[[[.,[[.,.],.]],.],.] => [2,3,1,4,5] => 0100 => 0010

[[[[.,.],[.,.]],.],.] => [1,3,2,4,5] => 0100 => 0010

[[[[.,[.,.]],.],.],.] => [2,1,3,4,5] => 1000 => 0001

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

[.,[.,[.,[.,[.,[.,.]]]]]] => [6,5,4,3,2,1] => 11111 => 11111

[.,[.,[.,[.,[[.,.],.]]]]] => [5,6,4,3,2,1] => 01111 => 11110

[.,[.,[.,[[.,.],[.,.]]]]] => [4,6,5,3,2,1] => 01111 => 11110

[.,[.,[.,[[.,[.,.]],.]]]] => [5,4,6,3,2,1] => 10111 => 11101

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

[.,[.,[[.,.],[.,[.,.]]]]] => [3,6,5,4,2,1] => 01111 => 11110

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

[.,[.,[[.,[.,.]],[.,.]]]] => [4,3,6,5,2,1] => 10111 => 11101

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

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

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

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

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

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

[.,[[.,.],[.,[.,[.,.]]]]] => [2,6,5,4,3,1] => 01111 => 11110

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

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

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

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

[.,[[.,[.,.]],[.,[.,.]]]] => [3,2,6,5,4,1] => 10111 => 11101

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

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

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

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

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

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

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

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

[.,[[.,[.,[.,[.,.]]]],.]] => [5,4,3,2,6,1] => 11101 => 10111

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

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

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

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

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

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

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

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

>>> Load all 1963 entries. <<<

Map

to 312-avoiding permutation

Description

Return a 312-avoiding permutation corresponding to a binary tree.
The linear extensions of a binary tree form an interval of the weak order called the Sylvester class of the tree. This permutation is the minimal element of this Sylvester class.

Map

descent word

Description

The descent positions of a permutation as a binary word.
For a permutation $\pi$ of $n$ letters and each $1\leq i\leq n-1$ such that $\pi(i) > \pi(i+1)$ we set $w_i=1$, otherwise $w_i=0$.
Thus, the length of the word is one less the size of the permutation. In particular, the descent word is undefined for the empty permutation.

Map

reverse

Description

Return the reversal of a binary word.