Identifier
-
Mp00017:
Binary trees
—to 312-avoiding permutation⟶
Permutations
St000255: Permutations ⟶ ℤ
Values
[.,.] => [1] => 1
[.,[.,.]] => [2,1] => 1
[[.,.],.] => [1,2] => 1
[.,[.,[.,.]]] => [3,2,1] => 1
[.,[[.,.],.]] => [2,3,1] => 1
[[.,.],[.,.]] => [1,3,2] => 2
[[.,[.,.]],.] => [2,1,3] => 1
[[[.,.],.],.] => [1,2,3] => 1
[.,[.,[.,[.,.]]]] => [4,3,2,1] => 1
[.,[.,[[.,.],.]]] => [3,4,2,1] => 1
[.,[[.,.],[.,.]]] => [2,4,3,1] => 2
[.,[[.,[.,.]],.]] => [3,2,4,1] => 1
[.,[[[.,.],.],.]] => [2,3,4,1] => 1
[[.,.],[.,[.,.]]] => [1,4,3,2] => 5
[[.,.],[[.,.],.]] => [1,3,4,2] => 3
[[.,[.,.]],[.,.]] => [2,1,4,3] => 3
[[[.,.],.],[.,.]] => [1,2,4,3] => 3
[[.,[.,[.,.]]],.] => [3,2,1,4] => 1
[[.,[[.,.],.]],.] => [2,3,1,4] => 1
[[[.,.],[.,.]],.] => [1,3,2,4] => 2
[[[.,[.,.]],.],.] => [2,1,3,4] => 1
[[[[.,.],.],.],.] => [1,2,3,4] => 1
[.,[.,[.,[.,[.,.]]]]] => [5,4,3,2,1] => 1
[.,[.,[.,[[.,.],.]]]] => [4,5,3,2,1] => 1
[.,[.,[[.,.],[.,.]]]] => [3,5,4,2,1] => 2
[.,[.,[[.,[.,.]],.]]] => [4,3,5,2,1] => 1
[.,[.,[[[.,.],.],.]]] => [3,4,5,2,1] => 1
[.,[[.,.],[.,[.,.]]]] => [2,5,4,3,1] => 5
[.,[[.,.],[[.,.],.]]] => [2,4,5,3,1] => 3
[.,[[.,[.,.]],[.,.]]] => [3,2,5,4,1] => 3
[.,[[[.,.],.],[.,.]]] => [2,3,5,4,1] => 3
[.,[[.,[.,[.,.]]],.]] => [4,3,2,5,1] => 1
[.,[[.,[[.,.],.]],.]] => [3,4,2,5,1] => 1
[.,[[[.,.],[.,.]],.]] => [2,4,3,5,1] => 2
[.,[[[.,[.,.]],.],.]] => [3,2,4,5,1] => 1
[.,[[[[.,.],.],.],.]] => [2,3,4,5,1] => 1
[[.,.],[.,[.,[.,.]]]] => [1,5,4,3,2] => 14
[[.,.],[.,[[.,.],.]]] => [1,4,5,3,2] => 9
[[.,.],[[.,.],[.,.]]] => [1,3,5,4,2] => 11
[[.,.],[[.,[.,.]],.]] => [1,4,3,5,2] => 7
[[.,.],[[[.,.],.],.]] => [1,3,4,5,2] => 4
[[.,[.,.]],[.,[.,.]]] => [2,1,5,4,3] => 14
[[.,[.,.]],[[.,.],.]] => [2,1,4,5,3] => 6
[[[.,.],.],[.,[.,.]]] => [1,2,5,4,3] => 14
[[[.,.],.],[[.,.],.]] => [1,2,4,5,3] => 6
[[.,[.,[.,.]]],[.,.]] => [3,2,1,5,4] => 4
[[.,[[.,.],.]],[.,.]] => [2,3,1,5,4] => 4
[[[.,.],[.,.]],[.,.]] => [1,3,2,5,4] => 8
[[[.,[.,.]],.],[.,.]] => [2,1,3,5,4] => 4
[[[[.,.],.],.],[.,.]] => [1,2,3,5,4] => 4
[[.,[.,[.,[.,.]]]],.] => [4,3,2,1,5] => 1
[[.,[.,[[.,.],.]]],.] => [3,4,2,1,5] => 1
[[.,[[.,.],[.,.]]],.] => [2,4,3,1,5] => 2
[[.,[[.,[.,.]],.]],.] => [3,2,4,1,5] => 1
[[.,[[[.,.],.],.]],.] => [2,3,4,1,5] => 1
[[[.,.],[.,[.,.]]],.] => [1,4,3,2,5] => 5
[[[.,.],[[.,.],.]],.] => [1,3,4,2,5] => 3
[[[.,[.,.]],[.,.]],.] => [2,1,4,3,5] => 3
[[[[.,.],.],[.,.]],.] => [1,2,4,3,5] => 3
[[[.,[.,[.,.]]],.],.] => [3,2,1,4,5] => 1
[[[.,[[.,.],.]],.],.] => [2,3,1,4,5] => 1
[[[[.,.],[.,.]],.],.] => [1,3,2,4,5] => 2
[[[[.,[.,.]],.],.],.] => [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
[.,[.,[.,[[.,.],[.,.]]]]] => [4,6,5,3,2,1] => 2
[.,[.,[.,[[.,[.,.]],.]]]] => [5,4,6,3,2,1] => 1
[.,[.,[.,[[[.,.],.],.]]]] => [4,5,6,3,2,1] => 1
[.,[.,[[.,.],[.,[.,.]]]]] => [3,6,5,4,2,1] => 5
[.,[.,[[.,.],[[.,.],.]]]] => [3,5,6,4,2,1] => 3
[.,[.,[[.,[.,.]],[.,.]]]] => [4,3,6,5,2,1] => 3
[.,[.,[[[.,.],.],[.,.]]]] => [3,4,6,5,2,1] => 3
[.,[.,[[.,[.,[.,.]]],.]]] => [5,4,3,6,2,1] => 1
[.,[.,[[.,[[.,.],.]],.]]] => [4,5,3,6,2,1] => 1
[.,[.,[[[.,.],[.,.]],.]]] => [3,5,4,6,2,1] => 2
[.,[.,[[[.,[.,.]],.],.]]] => [4,3,5,6,2,1] => 1
[.,[.,[[[[.,.],.],.],.]]] => [3,4,5,6,2,1] => 1
[.,[[.,.],[.,[.,[.,.]]]]] => [2,6,5,4,3,1] => 14
[.,[[.,.],[.,[[.,.],.]]]] => [2,5,6,4,3,1] => 9
[.,[[.,.],[[.,.],[.,.]]]] => [2,4,6,5,3,1] => 11
[.,[[.,.],[[.,[.,.]],.]]] => [2,5,4,6,3,1] => 7
[.,[[.,.],[[[.,.],.],.]]] => [2,4,5,6,3,1] => 4
[.,[[.,[.,.]],[.,[.,.]]]] => [3,2,6,5,4,1] => 14
[.,[[.,[.,.]],[[.,.],.]]] => [3,2,5,6,4,1] => 6
[.,[[[.,.],.],[.,[.,.]]]] => [2,3,6,5,4,1] => 14
[.,[[[.,.],.],[[.,.],.]]] => [2,3,5,6,4,1] => 6
[.,[[.,[.,[.,.]]],[.,.]]] => [4,3,2,6,5,1] => 4
[.,[[.,[[.,.],.]],[.,.]]] => [3,4,2,6,5,1] => 4
[.,[[[.,.],[.,.]],[.,.]]] => [2,4,3,6,5,1] => 8
[.,[[[.,[.,.]],.],[.,.]]] => [3,2,4,6,5,1] => 4
[.,[[[[.,.],.],.],[.,.]]] => [2,3,4,6,5,1] => 4
[.,[[.,[.,[.,[.,.]]]],.]] => [5,4,3,2,6,1] => 1
[.,[[.,[.,[[.,.],.]]],.]] => [4,5,3,2,6,1] => 1
[.,[[.,[[.,.],[.,.]]],.]] => [3,5,4,2,6,1] => 2
[.,[[.,[[.,[.,.]],.]],.]] => [4,3,5,2,6,1] => 1
[.,[[.,[[[.,.],.],.]],.]] => [3,4,5,2,6,1] => 1
[.,[[[.,.],[.,[.,.]]],.]] => [2,5,4,3,6,1] => 5
[.,[[[.,.],[[.,.],.]],.]] => [2,4,5,3,6,1] => 3
[.,[[[.,[.,.]],[.,.]],.]] => [3,2,5,4,6,1] => 3
[.,[[[[.,.],.],[.,.]],.]] => [2,3,5,4,6,1] => 3
>>> Load all 242 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 reduced Kogan faces with the permutation as type.
This is equivalent to finding the number of ways to represent the permutation $\pi \in S_{n+1}$ as a reduced subword of $s_n (s_{n-1} s_n) (s_{n-2} s_{n-1} s_n) \dotsm (s_1 \dotsm s_n)$, or the number of reduced pipe dreams for $\pi$.
This is equivalent to finding the number of ways to represent the permutation $\pi \in S_{n+1}$ as a reduced subword of $s_n (s_{n-1} s_n) (s_{n-2} s_{n-1} s_n) \dotsm (s_1 \dotsm s_n)$, or the number of reduced pipe dreams for $\pi$.
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.
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.
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!