Identifier
-
Mp00014:
Binary trees
—to 132-avoiding permutation⟶
Permutations
St000078: Permutations ⟶ ℤ
Values
[.,.] => [1] => 1
[.,[.,.]] => [2,1] => 1
[[.,.],.] => [1,2] => 1
[.,[.,[.,.]]] => [3,2,1] => 1
[.,[[.,.],.]] => [2,3,1] => 1
[[.,.],[.,.]] => [3,1,2] => 1
[[.,[.,.]],.] => [2,1,3] => 1
[[[.,.],.],.] => [1,2,3] => 1
[.,[.,[.,[.,.]]]] => [4,3,2,1] => 1
[.,[.,[[.,.],.]]] => [3,4,2,1] => 1
[.,[[.,.],[.,.]]] => [4,2,3,1] => 1
[.,[[.,[.,.]],.]] => [3,2,4,1] => 1
[.,[[[.,.],.],.]] => [2,3,4,1] => 1
[[.,.],[.,[.,.]]] => [4,3,1,2] => 1
[[.,.],[[.,.],.]] => [3,4,1,2] => 1
[[.,[.,.]],[.,.]] => [4,2,1,3] => 1
[[[.,.],.],[.,.]] => [4,1,2,3] => 1
[[.,[.,[.,.]]],.] => [3,2,1,4] => 1
[[.,[[.,.],.]],.] => [2,3,1,4] => 1
[[[.,.],[.,.]],.] => [3,1,2,4] => 1
[[[.,[.,.]],.],.] => [2,1,3,4] => 1
[[[[.,.],.],.],.] => [1,2,3,4] => 1
[.,[.,[.,[.,[.,.]]]]] => [5,4,3,2,1] => 1
[.,[.,[.,[[.,.],.]]]] => [4,5,3,2,1] => 1
[.,[.,[[.,.],[.,.]]]] => [5,3,4,2,1] => 1
[.,[.,[[.,[.,.]],.]]] => [4,3,5,2,1] => 1
[.,[.,[[[.,.],.],.]]] => [3,4,5,2,1] => 1
[.,[[.,.],[.,[.,.]]]] => [5,4,2,3,1] => 1
[.,[[.,.],[[.,.],.]]] => [4,5,2,3,1] => 1
[.,[[.,[.,.]],[.,.]]] => [5,3,2,4,1] => 1
[.,[[[.,.],.],[.,.]]] => [5,2,3,4,1] => 1
[.,[[.,[.,[.,.]]],.]] => [4,3,2,5,1] => 1
[.,[[.,[[.,.],.]],.]] => [3,4,2,5,1] => 1
[.,[[[.,.],[.,.]],.]] => [4,2,3,5,1] => 1
[.,[[[.,[.,.]],.],.]] => [3,2,4,5,1] => 1
[.,[[[[.,.],.],.],.]] => [2,3,4,5,1] => 1
[[.,.],[.,[.,[.,.]]]] => [5,4,3,1,2] => 1
[[.,.],[.,[[.,.],.]]] => [4,5,3,1,2] => 1
[[.,.],[[.,.],[.,.]]] => [5,3,4,1,2] => 1
[[.,.],[[.,[.,.]],.]] => [4,3,5,1,2] => 1
[[.,.],[[[.,.],.],.]] => [3,4,5,1,2] => 1
[[.,[.,.]],[.,[.,.]]] => [5,4,2,1,3] => 1
[[.,[.,.]],[[.,.],.]] => [4,5,2,1,3] => 1
[[[.,.],.],[.,[.,.]]] => [5,4,1,2,3] => 1
[[[.,.],.],[[.,.],.]] => [4,5,1,2,3] => 1
[[.,[.,[.,.]]],[.,.]] => [5,3,2,1,4] => 1
[[.,[[.,.],.]],[.,.]] => [5,2,3,1,4] => 1
[[[.,.],[.,.]],[.,.]] => [5,3,1,2,4] => 1
[[[.,[.,.]],.],[.,.]] => [5,2,1,3,4] => 1
[[[[.,.],.],.],[.,.]] => [5,1,2,3,4] => 1
[[.,[.,[.,[.,.]]]],.] => [4,3,2,1,5] => 1
[[.,[.,[[.,.],.]]],.] => [3,4,2,1,5] => 1
[[.,[[.,.],[.,.]]],.] => [4,2,3,1,5] => 1
[[.,[[.,[.,.]],.]],.] => [3,2,4,1,5] => 1
[[.,[[[.,.],.],.]],.] => [2,3,4,1,5] => 1
[[[.,.],[.,[.,.]]],.] => [4,3,1,2,5] => 1
[[[.,.],[[.,.],.]],.] => [3,4,1,2,5] => 1
[[[.,[.,.]],[.,.]],.] => [4,2,1,3,5] => 1
[[[[.,.],.],[.,.]],.] => [4,1,2,3,5] => 1
[[[.,[.,[.,.]]],.],.] => [3,2,1,4,5] => 1
[[[.,[[.,.],.]],.],.] => [2,3,1,4,5] => 1
[[[[.,.],[.,.]],.],.] => [3,1,2,4,5] => 1
[[[[.,[.,.]],.],.],.] => [2,1,3,4,5] => 1
[[[[[.,.],.],.],.],.] => [1,2,3,4,5] => 1
[.,[.,[.,[.,[.,[.,.]]]]]] => [6,5,4,3,2,1] => 1
[.,[.,[.,[.,[[.,.],.]]]]] => [5,6,4,3,2,1] => 1
[.,[.,[.,[[.,.],[.,.]]]]] => [6,4,5,3,2,1] => 1
[.,[.,[.,[[.,[.,.]],.]]]] => [5,4,6,3,2,1] => 1
[.,[.,[.,[[[.,.],.],.]]]] => [4,5,6,3,2,1] => 1
[.,[.,[[.,.],[.,[.,.]]]]] => [6,5,3,4,2,1] => 1
[.,[.,[[.,.],[[.,.],.]]]] => [5,6,3,4,2,1] => 1
[.,[.,[[.,[.,.]],[.,.]]]] => [6,4,3,5,2,1] => 1
[.,[.,[[[.,.],.],[.,.]]]] => [6,3,4,5,2,1] => 1
[.,[.,[[.,[.,[.,.]]],.]]] => [5,4,3,6,2,1] => 1
[.,[.,[[.,[[.,.],.]],.]]] => [4,5,3,6,2,1] => 1
[.,[.,[[[.,.],[.,.]],.]]] => [5,3,4,6,2,1] => 1
[.,[.,[[[.,[.,.]],.],.]]] => [4,3,5,6,2,1] => 1
[.,[.,[[[[.,.],.],.],.]]] => [3,4,5,6,2,1] => 1
[.,[[.,.],[.,[.,[.,.]]]]] => [6,5,4,2,3,1] => 1
[.,[[.,.],[.,[[.,.],.]]]] => [5,6,4,2,3,1] => 1
[.,[[.,.],[[.,.],[.,.]]]] => [6,4,5,2,3,1] => 1
[.,[[.,.],[[.,[.,.]],.]]] => [5,4,6,2,3,1] => 1
[.,[[.,.],[[[.,.],.],.]]] => [4,5,6,2,3,1] => 1
[.,[[.,[.,.]],[.,[.,.]]]] => [6,5,3,2,4,1] => 1
[.,[[.,[.,.]],[[.,.],.]]] => [5,6,3,2,4,1] => 1
[.,[[[.,.],.],[.,[.,.]]]] => [6,5,2,3,4,1] => 1
[.,[[[.,.],.],[[.,.],.]]] => [5,6,2,3,4,1] => 1
[.,[[.,[.,[.,.]]],[.,.]]] => [6,4,3,2,5,1] => 1
[.,[[.,[[.,.],.]],[.,.]]] => [6,3,4,2,5,1] => 1
[.,[[[.,.],[.,.]],[.,.]]] => [6,4,2,3,5,1] => 1
[.,[[[.,[.,.]],.],[.,.]]] => [6,3,2,4,5,1] => 1
[.,[[[[.,.],.],.],[.,.]]] => [6,2,3,4,5,1] => 1
[.,[[.,[.,[.,[.,.]]]],.]] => [5,4,3,2,6,1] => 1
[.,[[.,[.,[[.,.],.]]],.]] => [4,5,3,2,6,1] => 1
[.,[[.,[[.,.],[.,.]]],.]] => [5,3,4,2,6,1] => 1
[.,[[.,[[.,[.,.]],.]],.]] => [4,3,5,2,6,1] => 1
[.,[[.,[[[.,.],.],.]],.]] => [3,4,5,2,6,1] => 1
[.,[[[.,.],[.,[.,.]]],.]] => [5,4,2,3,6,1] => 1
[.,[[[.,.],[[.,.],.]],.]] => [4,5,2,3,6,1] => 1
[.,[[[.,[.,.]],[.,.]],.]] => [5,3,2,4,6,1] => 1
[.,[[[[.,.],.],[.,.]],.]] => [5,2,3,4,6,1] => 1
>>> Load all 227 entries. <<<
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
Description
The number of alternating sign matrices whose left key is the permutation.
The left key of an alternating sign matrix was defined by Lascoux
in [2] and is obtained by successively removing all the `-1`'s until what remains is a permutation matrix. This notion corresponds to the notion of left key for semistandard tableaux.
The left key of an alternating sign matrix was defined by Lascoux
in [2] and is obtained by successively removing all the `-1`'s until what remains is a permutation matrix. This notion corresponds to the notion of left key for semistandard tableaux.
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.
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.
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!