Identifier
-
Mp00014:
Binary trees
—to 132-avoiding permutation⟶
Permutations
Mp00239: Permutations —Corteel⟶ Permutations
St000664: 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] => [3,4,1,2] => 0
[.,[.,[[.,.],.]]] => [3,4,2,1] => [4,3,1,2] => 0
[.,[[.,.],[.,.]]] => [4,2,3,1] => [2,3,4,1] => 0
[.,[[.,[.,.]],.]] => [3,2,4,1] => [2,4,3,1] => 0
[.,[[[.,.],.],.]] => [2,3,4,1] => [4,2,3,1] => 0
[[.,.],[.,[.,.]]] => [4,3,1,2] => [3,4,2,1] => 0
[[.,.],[[.,.],.]] => [3,4,1,2] => [4,3,2,1] => 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] => 1
[[[.,[.,.]],.],.] => [2,1,3,4] => [2,1,3,4] => 0
[[[[.,.],.],.],.] => [1,2,3,4] => [1,2,3,4] => 0
[.,[.,[.,[.,[.,.]]]]] => [5,4,3,2,1] => [3,4,5,1,2] => 0
[.,[.,[.,[[.,.],.]]]] => [4,5,3,2,1] => [4,3,5,1,2] => 0
[.,[.,[[.,.],[.,.]]]] => [5,3,4,2,1] => [3,5,4,1,2] => 0
[.,[.,[[.,[.,.]],.]]] => [4,3,5,2,1] => [4,5,3,1,2] => 0
[.,[.,[[[.,.],.],.]]] => [3,4,5,2,1] => [5,4,3,1,2] => 0
[.,[[.,.],[.,[.,.]]]] => [5,4,2,3,1] => [4,5,1,2,3] => 0
[.,[[.,.],[[.,.],.]]] => [4,5,2,3,1] => [5,4,1,2,3] => 0
[.,[[.,[.,.]],[.,.]]] => [5,3,2,4,1] => [3,4,1,5,2] => 0
[.,[[[.,.],.],[.,.]]] => [5,2,3,4,1] => [2,3,4,5,1] => 0
[.,[[.,[.,[.,.]]],.]] => [4,3,2,5,1] => [3,5,1,4,2] => 0
[.,[[.,[[.,.],.]],.]] => [3,4,2,5,1] => [5,3,1,4,2] => 0
[.,[[[.,.],[.,.]],.]] => [4,2,3,5,1] => [2,3,5,4,1] => 1
[.,[[[.,[.,.]],.],.]] => [3,2,4,5,1] => [2,5,3,4,1] => 0
[.,[[[[.,.],.],.],.]] => [2,3,4,5,1] => [5,2,3,4,1] => 0
[[.,.],[.,[.,[.,.]]]] => [5,4,3,1,2] => [3,4,5,2,1] => 0
[[.,.],[.,[[.,.],.]]] => [4,5,3,1,2] => [4,3,5,2,1] => 0
[[.,.],[[.,.],[.,.]]] => [5,3,4,1,2] => [3,5,4,2,1] => 0
[[.,.],[[.,[.,.]],.]] => [4,3,5,1,2] => [4,5,3,2,1] => 0
[[.,.],[[[.,.],.],.]] => [3,4,5,1,2] => [5,4,3,2,1] => 0
[[.,[.,.]],[.,[.,.]]] => [5,4,2,1,3] => [4,5,1,3,2] => 0
[[.,[.,.]],[[.,.],.]] => [4,5,2,1,3] => [5,4,1,3,2] => 0
[[[.,.],.],[.,[.,.]]] => [5,4,1,2,3] => [4,5,2,3,1] => 0
[[[.,.],.],[[.,.],.]] => [4,5,1,2,3] => [5,4,2,3,1] => 0
[[.,[.,[.,.]]],[.,.]] => [5,3,2,1,4] => [3,5,1,2,4] => 1
[[.,[[.,.],.]],[.,.]] => [5,2,3,1,4] => [2,3,5,1,4] => 1
[[[.,.],[.,.]],[.,.]] => [5,3,1,2,4] => [3,5,2,1,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] => [3,4,1,2,5] => 1
[[.,[.,[[.,.],.]]],.] => [3,4,2,1,5] => [4,3,1,2,5] => 1
[[.,[[.,.],[.,.]]],.] => [4,2,3,1,5] => [2,3,4,1,5] => 0
[[.,[[.,[.,.]],.]],.] => [3,2,4,1,5] => [2,4,3,1,5] => 0
[[.,[[[.,.],.],.]],.] => [2,3,4,1,5] => [4,2,3,1,5] => 0
[[[.,.],[.,[.,.]]],.] => [4,3,1,2,5] => [3,4,2,1,5] => 0
[[[.,.],[[.,.],.]],.] => [3,4,1,2,5] => [4,3,2,1,5] => 0
[[[.,[.,.]],[.,.]],.] => [4,2,1,3,5] => [2,4,1,3,5] => 0
[[[[.,.],.],[.,.]],.] => [4,1,2,3,5] => [4,1,2,3,5] => 1
[[[.,[.,[.,.]]],.],.] => [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] => 1
[[[[.,[.,.]],.],.],.] => [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] => [4,5,6,1,2,3] => 0
[.,[.,[.,[.,[[.,.],.]]]]] => [5,6,4,3,2,1] => [5,4,6,1,2,3] => 0
[.,[.,[.,[[.,.],[.,.]]]]] => [6,4,5,3,2,1] => [4,6,5,1,2,3] => 0
[.,[.,[.,[[.,[.,.]],.]]]] => [5,4,6,3,2,1] => [5,6,4,1,2,3] => 0
[.,[.,[.,[[[.,.],.],.]]]] => [4,5,6,3,2,1] => [6,5,4,1,2,3] => 0
[.,[.,[[.,.],[.,[.,.]]]]] => [6,5,3,4,2,1] => [3,4,5,6,1,2] => 0
[.,[.,[[.,.],[[.,.],.]]]] => [5,6,3,4,2,1] => [4,3,5,6,1,2] => 0
[.,[.,[[.,[.,.]],[.,.]]]] => [6,4,3,5,2,1] => [3,4,6,5,1,2] => 1
[.,[.,[[[.,.],.],[.,.]]]] => [6,3,4,5,2,1] => [3,6,4,5,1,2] => 0
[.,[.,[[.,[.,[.,.]]],.]]] => [5,4,3,6,2,1] => [3,5,6,4,1,2] => 0
[.,[.,[[.,[[.,.],.]],.]]] => [4,5,3,6,2,1] => [5,3,6,4,1,2] => 0
[.,[.,[[[.,.],[.,.]],.]]] => [5,3,4,6,2,1] => [3,6,5,4,1,2] => 0
[.,[.,[[[.,[.,.]],.],.]]] => [4,3,5,6,2,1] => [5,6,3,4,1,2] => 0
[.,[.,[[[[.,.],.],.],.]]] => [3,4,5,6,2,1] => [6,5,3,4,1,2] => 0
[.,[[.,.],[.,[.,[.,.]]]]] => [6,5,4,2,3,1] => [4,5,6,2,1,3] => 0
[.,[[.,.],[.,[[.,.],.]]]] => [5,6,4,2,3,1] => [5,4,6,2,1,3] => 0
[.,[[.,.],[[.,.],[.,.]]]] => [6,4,5,2,3,1] => [4,6,5,2,1,3] => 0
[.,[[.,.],[[.,[.,.]],.]]] => [5,4,6,2,3,1] => [5,6,4,2,1,3] => 0
[.,[[.,.],[[[.,.],.],.]]] => [4,5,6,2,3,1] => [6,5,4,2,1,3] => 0
[.,[[.,[.,.]],[.,[.,.]]]] => [6,5,3,2,4,1] => [3,5,6,1,2,4] => 1
[.,[[.,[.,.]],[[.,.],.]]] => [5,6,3,2,4,1] => [5,3,6,1,2,4] => 1
[.,[[[.,.],.],[.,[.,.]]]] => [6,5,2,3,4,1] => [5,6,1,2,3,4] => 0
[.,[[[.,.],.],[[.,.],.]]] => [5,6,2,3,4,1] => [6,5,1,2,3,4] => 0
[.,[[.,[.,[.,.]]],[.,.]]] => [6,4,3,2,5,1] => [3,4,5,1,6,2] => 0
[.,[[.,[[.,.],.]],[.,.]]] => [6,3,4,2,5,1] => [3,5,4,1,6,2] => 0
[.,[[[.,.],[.,.]],[.,.]]] => [6,4,2,3,5,1] => [4,5,1,2,6,3] => 1
[.,[[[.,[.,.]],.],[.,.]]] => [6,3,2,4,5,1] => [3,4,1,5,6,2] => 0
[.,[[[[.,.],.],.],[.,.]]] => [6,2,3,4,5,1] => [2,3,4,5,6,1] => 0
[.,[[.,[.,[.,[.,.]]]],.]] => [5,4,3,2,6,1] => [3,4,6,1,5,2] => 1
[.,[[.,[.,[[.,.],.]]],.]] => [4,5,3,2,6,1] => [4,3,6,1,5,2] => 0
[.,[[.,[[.,.],[.,.]]],.]] => [5,3,4,2,6,1] => [3,6,4,1,5,2] => 0
[.,[[.,[[.,[.,.]],.]],.]] => [4,3,5,2,6,1] => [4,6,3,1,5,2] => 0
[.,[[.,[[[.,.],.],.]],.]] => [3,4,5,2,6,1] => [6,4,3,1,5,2] => 0
[.,[[[.,.],[.,[.,.]]],.]] => [5,4,2,3,6,1] => [4,6,1,2,5,3] => 1
[.,[[[.,.],[[.,.],.]],.]] => [4,5,2,3,6,1] => [6,4,1,2,5,3] => 1
[.,[[[.,[.,.]],[.,.]],.]] => [5,3,2,4,6,1] => [3,4,1,6,5,2] => 0
[.,[[[[.,.],.],[.,.]],.]] => [5,2,3,4,6,1] => [2,3,4,6,5,1] => 1
>>> Load all 197 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 right ropes of a permutation.
Let $\pi$ be a permutation of length $n$. A raft of $\pi$ is a non-empty maximal sequence of consecutive small ascents, St000441The number of successions of a permutation., and a right rope is a large ascent after a raft of $\pi$.
See Definition 3.10 and Example 3.11 in [1].
Let $\pi$ be a permutation of length $n$. A raft of $\pi$ is a non-empty maximal sequence of consecutive small ascents, St000441The number of successions of a permutation., and a right rope is a large ascent after a raft of $\pi$.
See Definition 3.10 and Example 3.11 in [1].
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.
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.
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!