Identifier
-
Mp00017:
Binary trees
—to 312-avoiding permutation⟶
Permutations
Mp00235: Permutations —descent views to invisible inversion bottoms⟶ Permutations
Mp00239: Permutations —Corteel⟶ Permutations
St001737: Permutations ⟶ ℤ
Values
[.,.] => [1] => [1] => [1] => 0
[.,[.,.]] => [2,1] => [2,1] => [2,1] => 1
[[.,.],.] => [1,2] => [1,2] => [1,2] => 0
[.,[.,[.,.]]] => [3,2,1] => [2,3,1] => [3,2,1] => 1
[.,[[.,.],.]] => [2,3,1] => [3,2,1] => [2,3,1] => 1
[[.,.],[.,.]] => [1,3,2] => [1,3,2] => [1,3,2] => 1
[[.,[.,.]],.] => [2,1,3] => [2,1,3] => [2,1,3] => 1
[[[.,.],.],.] => [1,2,3] => [1,2,3] => [1,2,3] => 0
[.,[.,[.,[.,.]]]] => [4,3,2,1] => [2,3,4,1] => [4,2,3,1] => 1
[.,[.,[[.,.],.]]] => [3,4,2,1] => [2,4,3,1] => [3,2,4,1] => 2
[.,[[.,.],[.,.]]] => [2,4,3,1] => [3,2,4,1] => [2,4,3,1] => 1
[.,[[.,[.,.]],.]] => [3,2,4,1] => [4,3,2,1] => [3,4,1,2] => 1
[.,[[[.,.],.],.]] => [2,3,4,1] => [4,2,3,1] => [2,3,4,1] => 1
[[.,.],[.,[.,.]]] => [1,4,3,2] => [1,3,4,2] => [1,4,3,2] => 1
[[.,.],[[.,.],.]] => [1,3,4,2] => [1,4,3,2] => [1,3,4,2] => 1
[[.,[.,.]],[.,.]] => [2,1,4,3] => [2,1,4,3] => [2,1,4,3] => 2
[[[.,.],.],[.,.]] => [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => 1
[[.,[.,[.,.]]],.] => [3,2,1,4] => [2,3,1,4] => [3,2,1,4] => 1
[[.,[[.,.],.]],.] => [2,3,1,4] => [3,2,1,4] => [2,3,1,4] => 1
[[[.,.],[.,.]],.] => [1,3,2,4] => [1,3,2,4] => [1,3,2,4] => 1
[[[.,[.,.]],.],.] => [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 1
[[[[.,.],.],.],.] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[.,[.,[.,[.,[.,.]]]]] => [5,4,3,2,1] => [2,3,4,5,1] => [5,2,3,4,1] => 1
[.,[.,[.,[[.,.],.]]]] => [4,5,3,2,1] => [2,3,5,4,1] => [4,2,3,5,1] => 2
[.,[.,[[.,.],[.,.]]]] => [3,5,4,2,1] => [2,4,3,5,1] => [3,2,5,4,1] => 2
[.,[.,[[.,[.,.]],.]]] => [4,3,5,2,1] => [2,5,4,3,1] => [4,2,5,1,3] => 2
[.,[.,[[[.,.],.],.]]] => [3,4,5,2,1] => [2,5,3,4,1] => [3,2,4,5,1] => 2
[.,[[.,.],[.,[.,.]]]] => [2,5,4,3,1] => [3,2,4,5,1] => [2,5,3,4,1] => 1
[.,[[.,.],[[.,.],.]]] => [2,4,5,3,1] => [3,2,5,4,1] => [2,4,3,5,1] => 2
[.,[[.,[.,.]],[.,.]]] => [3,2,5,4,1] => [4,3,2,5,1] => [3,5,1,4,2] => 1
[.,[[[.,.],.],[.,.]]] => [2,3,5,4,1] => [4,2,3,5,1] => [2,3,5,4,1] => 1
[.,[[.,[.,[.,.]]],.]] => [4,3,2,5,1] => [5,3,4,2,1] => [3,5,4,1,2] => 1
[.,[[.,[[.,.],.]],.]] => [3,4,2,5,1] => [5,4,3,2,1] => [3,4,5,1,2] => 1
[.,[[[.,.],[.,.]],.]] => [2,4,3,5,1] => [5,2,4,3,1] => [2,4,5,1,3] => 1
[.,[[[.,[.,.]],.],.]] => [3,2,4,5,1] => [5,3,2,4,1] => [3,4,1,5,2] => 2
[.,[[[[.,.],.],.],.]] => [2,3,4,5,1] => [5,2,3,4,1] => [2,3,4,5,1] => 1
[[.,.],[.,[.,[.,.]]]] => [1,5,4,3,2] => [1,3,4,5,2] => [1,5,3,4,2] => 1
[[.,.],[.,[[.,.],.]]] => [1,4,5,3,2] => [1,3,5,4,2] => [1,4,3,5,2] => 2
[[.,.],[[.,.],[.,.]]] => [1,3,5,4,2] => [1,4,3,5,2] => [1,3,5,4,2] => 1
[[.,.],[[.,[.,.]],.]] => [1,4,3,5,2] => [1,5,4,3,2] => [1,4,5,2,3] => 1
[[.,.],[[[.,.],.],.]] => [1,3,4,5,2] => [1,5,3,4,2] => [1,3,4,5,2] => 1
[[.,[.,.]],[.,[.,.]]] => [2,1,5,4,3] => [2,1,4,5,3] => [2,1,5,4,3] => 2
[[.,[.,.]],[[.,.],.]] => [2,1,4,5,3] => [2,1,5,4,3] => [2,1,4,5,3] => 2
[[[.,.],.],[.,[.,.]]] => [1,2,5,4,3] => [1,2,4,5,3] => [1,2,5,4,3] => 1
[[[.,.],.],[[.,.],.]] => [1,2,4,5,3] => [1,2,5,4,3] => [1,2,4,5,3] => 1
[[.,[.,[.,.]]],[.,.]] => [3,2,1,5,4] => [2,3,1,5,4] => [3,2,1,5,4] => 2
[[.,[[.,.],.]],[.,.]] => [2,3,1,5,4] => [3,2,1,5,4] => [2,3,1,5,4] => 2
[[[.,.],[.,.]],[.,.]] => [1,3,2,5,4] => [1,3,2,5,4] => [1,3,2,5,4] => 2
[[[.,[.,.]],.],[.,.]] => [2,1,3,5,4] => [2,1,3,5,4] => [2,1,3,5,4] => 2
[[[[.,.],.],.],[.,.]] => [1,2,3,5,4] => [1,2,3,5,4] => [1,2,3,5,4] => 1
[[.,[.,[.,[.,.]]]],.] => [4,3,2,1,5] => [2,3,4,1,5] => [4,2,3,1,5] => 1
[[.,[.,[[.,.],.]]],.] => [3,4,2,1,5] => [2,4,3,1,5] => [3,2,4,1,5] => 2
[[.,[[.,.],[.,.]]],.] => [2,4,3,1,5] => [3,2,4,1,5] => [2,4,3,1,5] => 1
[[.,[[.,[.,.]],.]],.] => [3,2,4,1,5] => [4,3,2,1,5] => [3,4,1,2,5] => 1
[[.,[[[.,.],.],.]],.] => [2,3,4,1,5] => [4,2,3,1,5] => [2,3,4,1,5] => 1
[[[.,.],[.,[.,.]]],.] => [1,4,3,2,5] => [1,3,4,2,5] => [1,4,3,2,5] => 1
[[[.,.],[[.,.],.]],.] => [1,3,4,2,5] => [1,4,3,2,5] => [1,3,4,2,5] => 1
[[[.,[.,.]],[.,.]],.] => [2,1,4,3,5] => [2,1,4,3,5] => [2,1,4,3,5] => 2
[[[[.,.],.],[.,.]],.] => [1,2,4,3,5] => [1,2,4,3,5] => [1,2,4,3,5] => 1
[[[.,[.,[.,.]]],.],.] => [3,2,1,4,5] => [2,3,1,4,5] => [3,2,1,4,5] => 1
[[[.,[[.,.],.]],.],.] => [2,3,1,4,5] => [3,2,1,4,5] => [2,3,1,4,5] => 1
[[[[.,.],[.,.]],.],.] => [1,3,2,4,5] => [1,3,2,4,5] => [1,3,2,4,5] => 1
[[[[.,[.,.]],.],.],.] => [2,1,3,4,5] => [2,1,3,4,5] => [2,1,3,4,5] => 1
[[[[[.,.],.],.],.],.] => [1,2,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => 0
[.,[.,[.,[.,[.,[.,.]]]]]] => [6,5,4,3,2,1] => [2,3,4,5,6,1] => [6,2,3,4,5,1] => 1
[.,[.,[.,[.,[[.,.],.]]]]] => [5,6,4,3,2,1] => [2,3,4,6,5,1] => [5,2,3,4,6,1] => 2
[.,[.,[.,[[.,.],[.,.]]]]] => [4,6,5,3,2,1] => [2,3,5,4,6,1] => [4,2,3,6,5,1] => 2
[.,[.,[.,[[.,[.,.]],.]]]] => [5,4,6,3,2,1] => [2,3,6,5,4,1] => [5,2,3,6,1,4] => 2
[.,[.,[.,[[[.,.],.],.]]]] => [4,5,6,3,2,1] => [2,3,6,4,5,1] => [4,2,3,5,6,1] => 2
[.,[.,[[.,.],[.,[.,.]]]]] => [3,6,5,4,2,1] => [2,4,3,5,6,1] => [3,2,6,4,5,1] => 2
[.,[.,[[.,.],[[.,.],.]]]] => [3,5,6,4,2,1] => [2,4,3,6,5,1] => [3,2,5,4,6,1] => 3
[.,[.,[[.,[.,.]],[.,.]]]] => [4,3,6,5,2,1] => [2,5,4,3,6,1] => [4,2,6,1,5,3] => 2
[.,[.,[[[.,.],.],[.,.]]]] => [3,4,6,5,2,1] => [2,5,3,4,6,1] => [3,2,4,6,5,1] => 2
[.,[.,[[.,[.,[.,.]]],.]]] => [5,4,3,6,2,1] => [2,6,4,5,3,1] => [4,2,6,5,1,3] => 2
[.,[.,[[.,[[.,.],.]],.]]] => [4,5,3,6,2,1] => [2,6,5,4,3,1] => [4,2,5,6,1,3] => 2
[.,[.,[[[.,.],[.,.]],.]]] => [3,5,4,6,2,1] => [2,6,3,5,4,1] => [3,2,5,6,1,4] => 2
[.,[.,[[[.,[.,.]],.],.]]] => [4,3,5,6,2,1] => [2,6,4,3,5,1] => [4,2,5,1,6,3] => 3
[.,[.,[[[[.,.],.],.],.]]] => [3,4,5,6,2,1] => [2,6,3,4,5,1] => [3,2,4,5,6,1] => 2
[.,[[.,.],[.,[.,[.,.]]]]] => [2,6,5,4,3,1] => [3,2,4,5,6,1] => [2,6,3,4,5,1] => 1
[.,[[.,.],[.,[[.,.],.]]]] => [2,5,6,4,3,1] => [3,2,4,6,5,1] => [2,5,3,4,6,1] => 2
[.,[[.,.],[[.,.],[.,.]]]] => [2,4,6,5,3,1] => [3,2,5,4,6,1] => [2,4,3,6,5,1] => 2
[.,[[.,.],[[.,[.,.]],.]]] => [2,5,4,6,3,1] => [3,2,6,5,4,1] => [2,5,3,6,1,4] => 2
[.,[[.,.],[[[.,.],.],.]]] => [2,4,5,6,3,1] => [3,2,6,4,5,1] => [2,4,3,5,6,1] => 2
[.,[[.,[.,.]],[.,[.,.]]]] => [3,2,6,5,4,1] => [4,3,2,5,6,1] => [3,6,1,4,5,2] => 1
[.,[[.,[.,.]],[[.,.],.]]] => [3,2,5,6,4,1] => [4,3,2,6,5,1] => [3,5,1,4,6,2] => 2
[.,[[[.,.],.],[.,[.,.]]]] => [2,3,6,5,4,1] => [4,2,3,5,6,1] => [2,3,6,4,5,1] => 1
[.,[[[.,.],.],[[.,.],.]]] => [2,3,5,6,4,1] => [4,2,3,6,5,1] => [2,3,5,4,6,1] => 2
[.,[[.,[.,[.,.]]],[.,.]]] => [4,3,2,6,5,1] => [5,3,4,2,6,1] => [3,6,4,1,5,2] => 1
[.,[[.,[[.,.],.]],[.,.]]] => [3,4,2,6,5,1] => [5,4,3,2,6,1] => [3,4,6,1,5,2] => 1
[.,[[[.,.],[.,.]],[.,.]]] => [2,4,3,6,5,1] => [5,2,4,3,6,1] => [2,4,6,1,5,3] => 1
[.,[[[.,[.,.]],.],[.,.]]] => [3,2,4,6,5,1] => [5,3,2,4,6,1] => [3,4,1,6,5,2] => 2
[.,[[[[.,.],.],.],[.,.]]] => [2,3,4,6,5,1] => [5,2,3,4,6,1] => [2,3,4,6,5,1] => 1
[.,[[.,[.,[.,[.,.]]]],.]] => [5,4,3,2,6,1] => [6,3,4,5,2,1] => [3,6,4,5,1,2] => 1
[.,[[.,[.,[[.,.],.]]],.]] => [4,5,3,2,6,1] => [6,3,5,4,2,1] => [3,5,4,6,1,2] => 2
[.,[[.,[[.,.],[.,.]]],.]] => [3,5,4,2,6,1] => [6,4,3,5,2,1] => [3,4,6,5,1,2] => 1
[.,[[.,[[.,[.,.]],.]],.]] => [4,3,5,2,6,1] => [6,5,4,3,2,1] => [4,5,6,1,2,3] => 1
[.,[[.,[[[.,.],.],.]],.]] => [3,4,5,2,6,1] => [6,5,3,4,2,1] => [3,4,5,6,1,2] => 1
[.,[[[.,.],[.,[.,.]]],.]] => [2,5,4,3,6,1] => [6,2,4,5,3,1] => [2,4,6,5,1,3] => 1
[.,[[[.,.],[[.,.],.]],.]] => [2,4,5,3,6,1] => [6,2,5,4,3,1] => [2,4,5,6,1,3] => 1
[.,[[[.,[.,.]],[.,.]],.]] => [3,2,5,4,6,1] => [6,3,2,5,4,1] => [3,5,1,6,2,4] => 2
[.,[[[[.,.],.],[.,.]],.]] => [2,3,5,4,6,1] => [6,2,3,5,4,1] => [2,3,5,6,1,4] => 1
>>> Load all 309 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 descents of type 2 in a permutation.
A position i∈[1,n−1] is a descent of type 2 of a permutation π of n letters, if it is a descent and if π(j)<π(i) for all j<i.
A position i∈[1,n−1] is a descent of type 2 of a permutation π of n letters, if it is a descent and if π(j)<π(i) for all j<i.
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.
Map
Corteel
Description
Corteel's map interchanging the number of crossings and the number of nestings of a permutation.
This involution creates a labelled bicoloured Motzkin path, using the Foata-Zeilberger map. In the corresponding bump diagram, each label records the number of arcs nesting the given arc. Then each label is replaced by its complement, and the inverse of the Foata-Zeilberger map is applied.
This involution creates a labelled bicoloured Motzkin path, using the Foata-Zeilberger map. In the corresponding bump diagram, each label records the number of arcs nesting the given arc. Then each label is replaced by its complement, and the inverse of the Foata-Zeilberger map is applied.
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 σ is a pair i<j such that i<σ(j)<σ(i). The element σ(j) is then an invisible inversion bottom.
A descent view in a permutation π is an element π(j) such that π(i+1)<π(j)<π(i), and additionally the smallest element in the decreasing run containing π(i) is smaller than the smallest element in the decreasing run containing π(j).
This map is a bijection χ:Sn→Sn, such that
An invisible inversion of a permutation σ is a pair i<j such that i<σ(j)<σ(i). The element σ(j) is then an invisible inversion bottom.
A descent view in a permutation π is an element π(j) such that π(i+1)<π(j)<π(i), and additionally the smallest element in the decreasing run containing π(i) is smaller than the smallest element in the decreasing run containing π(j).
This map is a bijection χ:Sn→Sn, such that
- the multiset of descent views in π is the multiset of invisible inversion bottoms in χ(π),
- the set of left-to-right maxima of π is the set of maximal elements in the cycles of χ(π),
- the set of global ascent of π is the set of global ascent of χ(π),
- the set of maximal elements in the decreasing runs of π is the set of weak deficiency positions of χ(π), and
- the set of minimal elements in the decreasing runs of π is the set of weak deficiency values of χ(π).
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!