Identifier
-
Mp00014:
Binary trees
—to 132-avoiding permutation⟶
Permutations
Mp00235: Permutations —descent views to invisible inversion bottoms⟶ Permutations
St000408: Permutations ⟶ ℤ
Values
[.,.] => [1] => [1] => 0
[.,[.,.]] => [2,1] => [2,1] => 0
[[.,.],.] => [1,2] => [1,2] => 0
[.,[.,[.,.]]] => [3,2,1] => [2,3,1] => 0
[.,[[.,.],.]] => [2,3,1] => [3,2,1] => 0
[[.,.],[.,.]] => [3,1,2] => [3,1,2] => 0
[[.,[.,.]],.] => [2,1,3] => [2,1,3] => 0
[[[.,.],.],.] => [1,2,3] => [1,2,3] => 0
[.,[.,[.,[.,.]]]] => [4,3,2,1] => [2,3,4,1] => 0
[.,[.,[[.,.],.]]] => [3,4,2,1] => [2,4,3,1] => 0
[.,[[.,.],[.,.]]] => [4,2,3,1] => [3,4,2,1] => 0
[.,[[.,[.,.]],.]] => [3,2,4,1] => [4,3,2,1] => 0
[.,[[[.,.],.],.]] => [2,3,4,1] => [4,2,3,1] => 1
[[.,.],[.,[.,.]]] => [4,3,1,2] => [3,1,4,2] => 0
[[.,.],[[.,.],.]] => [3,4,1,2] => [4,1,3,2] => 0
[[.,[.,.]],[.,.]] => [4,2,1,3] => [2,4,1,3] => 0
[[[.,.],.],[.,.]] => [4,1,2,3] => [4,1,2,3] => 0
[[.,[.,[.,.]]],.] => [3,2,1,4] => [2,3,1,4] => 0
[[.,[[.,.],.]],.] => [2,3,1,4] => [3,2,1,4] => 0
[[[.,.],[.,.]],.] => [3,1,2,4] => [3,1,2,4] => 0
[[[.,[.,.]],.],.] => [2,1,3,4] => [2,1,3,4] => 0
[[[[.,.],.],.],.] => [1,2,3,4] => [1,2,3,4] => 0
[.,[.,[.,[.,[.,.]]]]] => [5,4,3,2,1] => [2,3,4,5,1] => 0
[.,[.,[.,[[.,.],.]]]] => [4,5,3,2,1] => [2,3,5,4,1] => 0
[.,[.,[[.,.],[.,.]]]] => [5,3,4,2,1] => [2,4,5,3,1] => 0
[.,[.,[[.,[.,.]],.]]] => [4,3,5,2,1] => [2,5,4,3,1] => 0
[.,[.,[[[.,.],.],.]]] => [3,4,5,2,1] => [2,5,3,4,1] => 1
[.,[[.,.],[.,[.,.]]]] => [5,4,2,3,1] => [3,4,2,5,1] => 0
[.,[[.,.],[[.,.],.]]] => [4,5,2,3,1] => [3,5,2,4,1] => 1
[.,[[.,[.,.]],[.,.]]] => [5,3,2,4,1] => [4,3,5,2,1] => 0
[.,[[[.,.],.],[.,.]]] => [5,2,3,4,1] => [4,5,2,3,1] => 2
[.,[[.,[.,[.,.]]],.]] => [4,3,2,5,1] => [5,3,4,2,1] => 2
[.,[[.,[[.,.],.]],.]] => [3,4,2,5,1] => [5,4,3,2,1] => 0
[.,[[[.,.],[.,.]],.]] => [4,2,3,5,1] => [5,4,2,3,1] => 2
[.,[[[.,[.,.]],.],.]] => [3,2,4,5,1] => [5,3,2,4,1] => 2
[.,[[[[.,.],.],.],.]] => [2,3,4,5,1] => [5,2,3,4,1] => 3
[[.,.],[.,[.,[.,.]]]] => [5,4,3,1,2] => [3,1,4,5,2] => 0
[[.,.],[.,[[.,.],.]]] => [4,5,3,1,2] => [3,1,5,4,2] => 0
[[.,.],[[.,.],[.,.]]] => [5,3,4,1,2] => [4,1,5,3,2] => 0
[[.,.],[[.,[.,.]],.]] => [4,3,5,1,2] => [5,1,4,3,2] => 0
[[.,.],[[[.,.],.],.]] => [3,4,5,1,2] => [5,1,3,4,2] => 1
[[.,[.,.]],[.,[.,.]]] => [5,4,2,1,3] => [2,4,1,5,3] => 0
[[.,[.,.]],[[.,.],.]] => [4,5,2,1,3] => [2,5,1,4,3] => 0
[[[.,.],.],[.,[.,.]]] => [5,4,1,2,3] => [4,1,2,5,3] => 0
[[[.,.],.],[[.,.],.]] => [4,5,1,2,3] => [5,1,2,4,3] => 0
[[.,[.,[.,.]]],[.,.]] => [5,3,2,1,4] => [2,3,5,1,4] => 0
[[.,[[.,.],.]],[.,.]] => [5,2,3,1,4] => [3,5,2,1,4] => 0
[[[.,.],[.,.]],[.,.]] => [5,3,1,2,4] => [3,1,5,2,4] => 0
[[[.,[.,.]],.],[.,.]] => [5,2,1,3,4] => [2,5,1,3,4] => 0
[[[[.,.],.],.],[.,.]] => [5,1,2,3,4] => [5,1,2,3,4] => 0
[[.,[.,[.,[.,.]]]],.] => [4,3,2,1,5] => [2,3,4,1,5] => 0
[[.,[.,[[.,.],.]]],.] => [3,4,2,1,5] => [2,4,3,1,5] => 0
[[.,[[.,.],[.,.]]],.] => [4,2,3,1,5] => [3,4,2,1,5] => 0
[[.,[[.,[.,.]],.]],.] => [3,2,4,1,5] => [4,3,2,1,5] => 0
[[.,[[[.,.],.],.]],.] => [2,3,4,1,5] => [4,2,3,1,5] => 1
[[[.,.],[.,[.,.]]],.] => [4,3,1,2,5] => [3,1,4,2,5] => 0
[[[.,.],[[.,.],.]],.] => [3,4,1,2,5] => [4,1,3,2,5] => 0
[[[.,[.,.]],[.,.]],.] => [4,2,1,3,5] => [2,4,1,3,5] => 0
[[[[.,.],.],[.,.]],.] => [4,1,2,3,5] => [4,1,2,3,5] => 0
[[[.,[.,[.,.]]],.],.] => [3,2,1,4,5] => [2,3,1,4,5] => 0
[[[.,[[.,.],.]],.],.] => [2,3,1,4,5] => [3,2,1,4,5] => 0
[[[[.,.],[.,.]],.],.] => [3,1,2,4,5] => [3,1,2,4,5] => 0
[[[[.,[.,.]],.],.],.] => [2,1,3,4,5] => [2,1,3,4,5] => 0
[[[[[.,.],.],.],.],.] => [1,2,3,4,5] => [1,2,3,4,5] => 0
[.,[.,[.,[.,[.,[.,.]]]]]] => [6,5,4,3,2,1] => [2,3,4,5,6,1] => 0
[.,[.,[.,[.,[[.,.],.]]]]] => [5,6,4,3,2,1] => [2,3,4,6,5,1] => 0
[.,[.,[.,[[.,.],[.,.]]]]] => [6,4,5,3,2,1] => [2,3,5,6,4,1] => 0
[.,[.,[.,[[.,[.,.]],.]]]] => [5,4,6,3,2,1] => [2,3,6,5,4,1] => 0
[.,[.,[.,[[[.,.],.],.]]]] => [4,5,6,3,2,1] => [2,3,6,4,5,1] => 1
[.,[.,[[.,.],[.,[.,.]]]]] => [6,5,3,4,2,1] => [2,4,5,3,6,1] => 0
[.,[.,[[.,.],[[.,.],.]]]] => [5,6,3,4,2,1] => [2,4,6,3,5,1] => 1
[.,[.,[[.,[.,.]],[.,.]]]] => [6,4,3,5,2,1] => [2,5,4,6,3,1] => 0
[.,[.,[[[.,.],.],[.,.]]]] => [6,3,4,5,2,1] => [2,5,6,3,4,1] => 2
[.,[.,[[.,[.,[.,.]]],.]]] => [5,4,3,6,2,1] => [2,6,4,5,3,1] => 2
[.,[.,[[.,[[.,.],.]],.]]] => [4,5,3,6,2,1] => [2,6,5,4,3,1] => 0
[.,[.,[[[.,.],[.,.]],.]]] => [5,3,4,6,2,1] => [2,6,5,3,4,1] => 2
[.,[.,[[[.,[.,.]],.],.]]] => [4,3,5,6,2,1] => [2,6,4,3,5,1] => 2
[.,[.,[[[[.,.],.],.],.]]] => [3,4,5,6,2,1] => [2,6,3,4,5,1] => 3
[.,[[.,.],[.,[.,[.,.]]]]] => [6,5,4,2,3,1] => [3,4,2,5,6,1] => 0
[.,[[.,.],[.,[[.,.],.]]]] => [5,6,4,2,3,1] => [3,4,2,6,5,1] => 0
[.,[[.,.],[[.,.],[.,.]]]] => [6,4,5,2,3,1] => [3,5,2,6,4,1] => 1
[.,[[.,.],[[.,[.,.]],.]]] => [5,4,6,2,3,1] => [3,6,2,5,4,1] => 2
[.,[[.,.],[[[.,.],.],.]]] => [4,5,6,2,3,1] => [3,6,2,4,5,1] => 3
[.,[[.,[.,.]],[.,[.,.]]]] => [6,5,3,2,4,1] => [4,3,5,2,6,1] => 0
[.,[[.,[.,.]],[[.,.],.]]] => [5,6,3,2,4,1] => [4,3,6,2,5,1] => 1
[.,[[[.,.],.],[.,[.,.]]]] => [6,5,2,3,4,1] => [4,5,2,3,6,1] => 2
[.,[[[.,.],.],[[.,.],.]]] => [5,6,2,3,4,1] => [4,6,2,3,5,1] => 4
[.,[[.,[.,[.,.]]],[.,.]]] => [6,4,3,2,5,1] => [5,3,4,6,2,1] => 2
[.,[[.,[[.,.],.]],[.,.]]] => [6,3,4,2,5,1] => [5,4,6,3,2,1] => 0
[.,[[[.,.],[.,.]],[.,.]]] => [6,4,2,3,5,1] => [5,4,2,6,3,1] => 2
[.,[[[.,[.,.]],.],[.,.]]] => [6,3,2,4,5,1] => [5,3,6,2,4,1] => 3
[.,[[[[.,.],.],.],[.,.]]] => [6,2,3,4,5,1] => [5,6,2,3,4,1] => 6
[.,[[.,[.,[.,[.,.]]]],.]] => [5,4,3,2,6,1] => [6,3,4,5,2,1] => 6
[.,[[.,[.,[[.,.],.]]],.]] => [4,5,3,2,6,1] => [6,3,5,4,2,1] => 4
[.,[[.,[[.,.],[.,.]]],.]] => [5,3,4,2,6,1] => [6,4,5,3,2,1] => 3
[.,[[.,[[.,[.,.]],.]],.]] => [4,3,5,2,6,1] => [6,5,4,3,2,1] => 0
[.,[[.,[[[.,.],.],.]],.]] => [3,4,5,2,6,1] => [6,5,3,4,2,1] => 4
[.,[[[.,.],[.,[.,.]]],.]] => [5,4,2,3,6,1] => [6,4,2,5,3,1] => 5
[.,[[[.,.],[[.,.],.]],.]] => [4,5,2,3,6,1] => [6,5,2,4,3,1] => 4
[.,[[[.,[.,.]],[.,.]],.]] => [5,3,2,4,6,1] => [6,3,5,2,4,1] => 5
[.,[[[[.,.],.],[.,.]],.]] => [5,2,3,4,6,1] => [6,5,2,3,4,1] => 6
>>> Load all 314 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 occurrences of the pattern 4231 in a permutation.
It is a necessary condition that a permutation $\pi$ avoids this pattern for the Schubert variety associated to $\pi$ to be smooth [2].
It is a necessary condition that a permutation $\pi$ avoids this pattern for the Schubert variety associated to $\pi$ to be smooth [2].
Map
descent views to invisible inversion bottoms
Description
Return a permutation whose multiset of invisible inversion bottoms is the multiset of descent views of the given permutation.
An invisible inversion of a permutation $\sigma$ is a pair $i < j$ such that $i < \sigma(j) < \sigma(i)$. The element $\sigma(j)$ is then an invisible inversion bottom.
A descent view in a permutation $\pi$ is an element $\pi(j)$ such that $\pi(i+1) < \pi(j) < \pi(i)$, and additionally the smallest element in the decreasing run containing $\pi(i)$ is smaller than the smallest element in the decreasing run containing $\pi(j)$.
This map is a bijection $\chi:\mathfrak S_n \to \mathfrak S_n$, such that
An invisible inversion of a permutation $\sigma$ is a pair $i < j$ such that $i < \sigma(j) < \sigma(i)$. The element $\sigma(j)$ is then an invisible inversion bottom.
A descent view in a permutation $\pi$ is an element $\pi(j)$ such that $\pi(i+1) < \pi(j) < \pi(i)$, and additionally the smallest element in the decreasing run containing $\pi(i)$ is smaller than the smallest element in the decreasing run containing $\pi(j)$.
This map is a bijection $\chi:\mathfrak S_n \to \mathfrak S_n$, such that
- the multiset of descent views in $\pi$ is the multiset of invisible inversion bottoms in $\chi(\pi)$,
- the set of left-to-right maxima of $\pi$ is the set of maximal elements in the cycles of $\chi(\pi)$,
- the set of global ascent of $\pi$ is the set of global ascent of $\chi(\pi)$,
- the set of maximal elements in the decreasing runs of $\pi$ is the set of weak deficiency positions of $\chi(\pi)$, and
- the set of minimal elements in the decreasing runs of $\pi$ is the set of weak deficiency values of $\chi(\pi)$.
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!