- FindStat

Identifier

Mp00014: Binary trees —to 132-avoiding permutation⟶ Permutations
Mp00109: Permutations —descent word⟶ Binary words

Images

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

>>> Load all 1920 entries. <<<

Map

to 132-avoiding permutation

Description

Return a 132-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 maximal element of the 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.