Identifier
-
Mp00014:
Binary trees
—to 132-avoiding permutation⟶
Permutations
Mp00223: Permutations —runsort⟶ Permutations
Mp00089: Permutations —Inverse Kreweras complement⟶ Permutations
St001550: Permutations ⟶ ℤ
Values
[.,.] => [1] => [1] => [1] => 0
[.,[.,.]] => [2,1] => [1,2] => [2,1] => 0
[[.,.],.] => [1,2] => [1,2] => [2,1] => 0
[.,[.,[.,.]]] => [3,2,1] => [1,2,3] => [2,3,1] => 0
[.,[[.,.],.]] => [2,3,1] => [1,2,3] => [2,3,1] => 0
[[.,.],[.,.]] => [3,1,2] => [1,2,3] => [2,3,1] => 0
[[.,[.,.]],.] => [2,1,3] => [1,3,2] => [3,2,1] => 0
[[[.,.],.],.] => [1,2,3] => [1,2,3] => [2,3,1] => 0
[.,[.,[.,[.,.]]]] => [4,3,2,1] => [1,2,3,4] => [2,3,4,1] => 0
[.,[.,[[.,.],.]]] => [3,4,2,1] => [1,2,3,4] => [2,3,4,1] => 0
[.,[[.,.],[.,.]]] => [4,2,3,1] => [1,2,3,4] => [2,3,4,1] => 0
[.,[[.,[.,.]],.]] => [3,2,4,1] => [1,2,4,3] => [2,4,3,1] => 0
[.,[[[.,.],.],.]] => [2,3,4,1] => [1,2,3,4] => [2,3,4,1] => 0
[[.,.],[.,[.,.]]] => [4,3,1,2] => [1,2,3,4] => [2,3,4,1] => 0
[[.,.],[[.,.],.]] => [3,4,1,2] => [1,2,3,4] => [2,3,4,1] => 0
[[.,[.,.]],[.,.]] => [4,2,1,3] => [1,3,2,4] => [3,2,4,1] => 0
[[[.,.],.],[.,.]] => [4,1,2,3] => [1,2,3,4] => [2,3,4,1] => 0
[[.,[.,[.,.]]],.] => [3,2,1,4] => [1,4,2,3] => [3,4,2,1] => 0
[[.,[[.,.],.]],.] => [2,3,1,4] => [1,4,2,3] => [3,4,2,1] => 0
[[[.,.],[.,.]],.] => [3,1,2,4] => [1,2,4,3] => [2,4,3,1] => 0
[[[.,[.,.]],.],.] => [2,1,3,4] => [1,3,4,2] => [4,2,3,1] => 0
[[[[.,.],.],.],.] => [1,2,3,4] => [1,2,3,4] => [2,3,4,1] => 0
[.,[.,[.,[.,[.,.]]]]] => [5,4,3,2,1] => [1,2,3,4,5] => [2,3,4,5,1] => 0
[.,[.,[.,[[.,.],.]]]] => [4,5,3,2,1] => [1,2,3,4,5] => [2,3,4,5,1] => 0
[.,[.,[[.,.],[.,.]]]] => [5,3,4,2,1] => [1,2,3,4,5] => [2,3,4,5,1] => 0
[.,[.,[[.,[.,.]],.]]] => [4,3,5,2,1] => [1,2,3,5,4] => [2,3,5,4,1] => 0
[.,[.,[[[.,.],.],.]]] => [3,4,5,2,1] => [1,2,3,4,5] => [2,3,4,5,1] => 0
[.,[[.,.],[.,[.,.]]]] => [5,4,2,3,1] => [1,2,3,4,5] => [2,3,4,5,1] => 0
[.,[[.,.],[[.,.],.]]] => [4,5,2,3,1] => [1,2,3,4,5] => [2,3,4,5,1] => 0
[.,[[.,[.,.]],[.,.]]] => [5,3,2,4,1] => [1,2,4,3,5] => [2,4,3,5,1] => 0
[.,[[[.,.],.],[.,.]]] => [5,2,3,4,1] => [1,2,3,4,5] => [2,3,4,5,1] => 0
[.,[[.,[.,[.,.]]],.]] => [4,3,2,5,1] => [1,2,5,3,4] => [2,4,5,3,1] => 0
[.,[[.,[[.,.],.]],.]] => [3,4,2,5,1] => [1,2,5,3,4] => [2,4,5,3,1] => 0
[.,[[[.,.],[.,.]],.]] => [4,2,3,5,1] => [1,2,3,5,4] => [2,3,5,4,1] => 0
[.,[[[.,[.,.]],.],.]] => [3,2,4,5,1] => [1,2,4,5,3] => [2,5,3,4,1] => 0
[.,[[[[.,.],.],.],.]] => [2,3,4,5,1] => [1,2,3,4,5] => [2,3,4,5,1] => 0
[[.,.],[.,[.,[.,.]]]] => [5,4,3,1,2] => [1,2,3,4,5] => [2,3,4,5,1] => 0
[[.,.],[.,[[.,.],.]]] => [4,5,3,1,2] => [1,2,3,4,5] => [2,3,4,5,1] => 0
[[.,.],[[.,.],[.,.]]] => [5,3,4,1,2] => [1,2,3,4,5] => [2,3,4,5,1] => 0
[[.,.],[[.,[.,.]],.]] => [4,3,5,1,2] => [1,2,3,5,4] => [2,3,5,4,1] => 0
[[.,.],[[[.,.],.],.]] => [3,4,5,1,2] => [1,2,3,4,5] => [2,3,4,5,1] => 0
[[.,[.,.]],[.,[.,.]]] => [5,4,2,1,3] => [1,3,2,4,5] => [3,2,4,5,1] => 0
[[.,[.,.]],[[.,.],.]] => [4,5,2,1,3] => [1,3,2,4,5] => [3,2,4,5,1] => 0
[[[.,.],.],[.,[.,.]]] => [5,4,1,2,3] => [1,2,3,4,5] => [2,3,4,5,1] => 0
[[[.,.],.],[[.,.],.]] => [4,5,1,2,3] => [1,2,3,4,5] => [2,3,4,5,1] => 0
[[.,[.,[.,.]]],[.,.]] => [5,3,2,1,4] => [1,4,2,3,5] => [3,4,2,5,1] => 0
[[.,[[.,.],.]],[.,.]] => [5,2,3,1,4] => [1,4,2,3,5] => [3,4,2,5,1] => 0
[[[.,.],[.,.]],[.,.]] => [5,3,1,2,4] => [1,2,4,3,5] => [2,4,3,5,1] => 0
[[[.,[.,.]],.],[.,.]] => [5,2,1,3,4] => [1,3,4,2,5] => [4,2,3,5,1] => 0
[[[[.,.],.],.],[.,.]] => [5,1,2,3,4] => [1,2,3,4,5] => [2,3,4,5,1] => 0
[[.,[.,[.,[.,.]]]],.] => [4,3,2,1,5] => [1,5,2,3,4] => [3,4,5,2,1] => 0
[[.,[.,[[.,.],.]]],.] => [3,4,2,1,5] => [1,5,2,3,4] => [3,4,5,2,1] => 0
[[.,[[.,.],[.,.]]],.] => [4,2,3,1,5] => [1,5,2,3,4] => [3,4,5,2,1] => 0
[[.,[[.,[.,.]],.]],.] => [3,2,4,1,5] => [1,5,2,4,3] => [3,5,4,2,1] => 1
[[.,[[[.,.],.],.]],.] => [2,3,4,1,5] => [1,5,2,3,4] => [3,4,5,2,1] => 0
[[[.,.],[.,[.,.]]],.] => [4,3,1,2,5] => [1,2,5,3,4] => [2,4,5,3,1] => 0
[[[.,.],[[.,.],.]],.] => [3,4,1,2,5] => [1,2,5,3,4] => [2,4,5,3,1] => 0
[[[.,[.,.]],[.,.]],.] => [4,2,1,3,5] => [1,3,5,2,4] => [4,2,5,3,1] => 0
[[[[.,.],.],[.,.]],.] => [4,1,2,3,5] => [1,2,3,5,4] => [2,3,5,4,1] => 0
[[[.,[.,[.,.]]],.],.] => [3,2,1,4,5] => [1,4,5,2,3] => [4,5,2,3,1] => 0
[[[.,[[.,.],.]],.],.] => [2,3,1,4,5] => [1,4,5,2,3] => [4,5,2,3,1] => 0
[[[[.,.],[.,.]],.],.] => [3,1,2,4,5] => [1,2,4,5,3] => [2,5,3,4,1] => 0
[[[[.,[.,.]],.],.],.] => [2,1,3,4,5] => [1,3,4,5,2] => [5,2,3,4,1] => 0
[[[[[.,.],.],.],.],.] => [1,2,3,4,5] => [1,2,3,4,5] => [2,3,4,5,1] => 0
[.,[.,[.,[.,[.,[.,.]]]]]] => [6,5,4,3,2,1] => [1,2,3,4,5,6] => [2,3,4,5,6,1] => 0
[.,[.,[.,[.,[[.,.],.]]]]] => [5,6,4,3,2,1] => [1,2,3,4,5,6] => [2,3,4,5,6,1] => 0
[.,[.,[.,[[.,.],[.,.]]]]] => [6,4,5,3,2,1] => [1,2,3,4,5,6] => [2,3,4,5,6,1] => 0
[.,[.,[.,[[.,[.,.]],.]]]] => [5,4,6,3,2,1] => [1,2,3,4,6,5] => [2,3,4,6,5,1] => 0
[.,[.,[.,[[[.,.],.],.]]]] => [4,5,6,3,2,1] => [1,2,3,4,5,6] => [2,3,4,5,6,1] => 0
[.,[.,[[.,.],[.,[.,.]]]]] => [6,5,3,4,2,1] => [1,2,3,4,5,6] => [2,3,4,5,6,1] => 0
[.,[.,[[.,.],[[.,.],.]]]] => [5,6,3,4,2,1] => [1,2,3,4,5,6] => [2,3,4,5,6,1] => 0
[.,[.,[[.,[.,.]],[.,.]]]] => [6,4,3,5,2,1] => [1,2,3,5,4,6] => [2,3,5,4,6,1] => 0
[.,[.,[[[.,.],.],[.,.]]]] => [6,3,4,5,2,1] => [1,2,3,4,5,6] => [2,3,4,5,6,1] => 0
[.,[.,[[.,[.,[.,.]]],.]]] => [5,4,3,6,2,1] => [1,2,3,6,4,5] => [2,3,5,6,4,1] => 0
[.,[.,[[.,[[.,.],.]],.]]] => [4,5,3,6,2,1] => [1,2,3,6,4,5] => [2,3,5,6,4,1] => 0
[.,[.,[[[.,.],[.,.]],.]]] => [5,3,4,6,2,1] => [1,2,3,4,6,5] => [2,3,4,6,5,1] => 0
[.,[.,[[[.,[.,.]],.],.]]] => [4,3,5,6,2,1] => [1,2,3,5,6,4] => [2,3,6,4,5,1] => 0
[.,[.,[[[[.,.],.],.],.]]] => [3,4,5,6,2,1] => [1,2,3,4,5,6] => [2,3,4,5,6,1] => 0
[.,[[.,.],[.,[.,[.,.]]]]] => [6,5,4,2,3,1] => [1,2,3,4,5,6] => [2,3,4,5,6,1] => 0
[.,[[.,.],[.,[[.,.],.]]]] => [5,6,4,2,3,1] => [1,2,3,4,5,6] => [2,3,4,5,6,1] => 0
[.,[[.,.],[[.,.],[.,.]]]] => [6,4,5,2,3,1] => [1,2,3,4,5,6] => [2,3,4,5,6,1] => 0
[.,[[.,.],[[.,[.,.]],.]]] => [5,4,6,2,3,1] => [1,2,3,4,6,5] => [2,3,4,6,5,1] => 0
[.,[[.,.],[[[.,.],.],.]]] => [4,5,6,2,3,1] => [1,2,3,4,5,6] => [2,3,4,5,6,1] => 0
[.,[[.,[.,.]],[.,[.,.]]]] => [6,5,3,2,4,1] => [1,2,4,3,5,6] => [2,4,3,5,6,1] => 0
[.,[[.,[.,.]],[[.,.],.]]] => [5,6,3,2,4,1] => [1,2,4,3,5,6] => [2,4,3,5,6,1] => 0
[.,[[[.,.],.],[.,[.,.]]]] => [6,5,2,3,4,1] => [1,2,3,4,5,6] => [2,3,4,5,6,1] => 0
[.,[[[.,.],.],[[.,.],.]]] => [5,6,2,3,4,1] => [1,2,3,4,5,6] => [2,3,4,5,6,1] => 0
[.,[[.,[.,[.,.]]],[.,.]]] => [6,4,3,2,5,1] => [1,2,5,3,4,6] => [2,4,5,3,6,1] => 0
[.,[[.,[[.,.],.]],[.,.]]] => [6,3,4,2,5,1] => [1,2,5,3,4,6] => [2,4,5,3,6,1] => 0
[.,[[[.,.],[.,.]],[.,.]]] => [6,4,2,3,5,1] => [1,2,3,5,4,6] => [2,3,5,4,6,1] => 0
[.,[[[.,[.,.]],.],[.,.]]] => [6,3,2,4,5,1] => [1,2,4,5,3,6] => [2,5,3,4,6,1] => 0
[.,[[[[.,.],.],.],[.,.]]] => [6,2,3,4,5,1] => [1,2,3,4,5,6] => [2,3,4,5,6,1] => 0
[.,[[.,[.,[.,[.,.]]]],.]] => [5,4,3,2,6,1] => [1,2,6,3,4,5] => [2,4,5,6,3,1] => 0
[.,[[.,[.,[[.,.],.]]],.]] => [4,5,3,2,6,1] => [1,2,6,3,4,5] => [2,4,5,6,3,1] => 0
[.,[[.,[[.,.],[.,.]]],.]] => [5,3,4,2,6,1] => [1,2,6,3,4,5] => [2,4,5,6,3,1] => 0
[.,[[.,[[.,[.,.]],.]],.]] => [4,3,5,2,6,1] => [1,2,6,3,5,4] => [2,4,6,5,3,1] => 1
[.,[[.,[[[.,.],.],.]],.]] => [3,4,5,2,6,1] => [1,2,6,3,4,5] => [2,4,5,6,3,1] => 0
[.,[[[.,.],[.,[.,.]]],.]] => [5,4,2,3,6,1] => [1,2,3,6,4,5] => [2,3,5,6,4,1] => 0
[.,[[[.,.],[[.,.],.]],.]] => [4,5,2,3,6,1] => [1,2,3,6,4,5] => [2,3,5,6,4,1] => 0
[.,[[[.,[.,.]],[.,.]],.]] => [5,3,2,4,6,1] => [1,2,4,6,3,5] => [2,5,3,6,4,1] => 0
[.,[[[[.,.],.],[.,.]],.]] => [5,2,3,4,6,1] => [1,2,3,4,6,5] => [2,3,4,6,5,1] => 0
>>> Load all 196 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 inversions between exceedances where the greater exceedance is linked.
This is for a permutation $\sigma$ of length $n$ given by
$$\operatorname{ile}(\sigma) = \#\{1 \leq i, j \leq n \mid i < j < \sigma(j) < \sigma(i) \wedge \sigma^{-1}(j) < j \}.$$
This is for a permutation $\sigma$ of length $n$ given by
$$\operatorname{ile}(\sigma) = \#\{1 \leq i, j \leq n \mid i < j < \sigma(j) < \sigma(i) \wedge \sigma^{-1}(j) < j \}.$$
Map
runsort
Description
The permutation obtained by sorting the increasing runs lexicographically.
Map
Inverse Kreweras complement
Description
Sends the permutation $\pi \in \mathfrak{S}_n$ to the permutation $c\pi^{-1}$ where $c = (1,\ldots,n)$ is the long cycle.
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!