Identifier
-
Mp00122:
Dyck paths
—Elizalde-Deutsch bijection⟶
Dyck paths
Mp00140: Dyck paths —logarithmic height to pruning number⟶ Binary trees
Mp00014: Binary trees —to 132-avoiding permutation⟶ Permutations
St000358: Permutations ⟶ ℤ
Values
[1,0] => [1,0] => [.,.] => [1] => 0
[1,0,1,0] => [1,1,0,0] => [[.,.],.] => [1,2] => 0
[1,1,0,0] => [1,0,1,0] => [.,[.,.]] => [2,1] => 0
[1,0,1,0,1,0] => [1,1,0,0,1,0] => [[.,[.,.]],.] => [2,1,3] => 0
[1,0,1,1,0,0] => [1,1,0,1,0,0] => [[[.,.],.],.] => [1,2,3] => 0
[1,1,0,0,1,0] => [1,1,1,0,0,0] => [[.,.],[.,.]] => [3,1,2] => 1
[1,1,0,1,0,0] => [1,0,1,1,0,0] => [.,[[.,.],.]] => [2,3,1] => 0
[1,1,1,0,0,0] => [1,0,1,0,1,0] => [.,[.,[.,.]]] => [3,2,1] => 0
[1,0,1,0,1,0,1,0] => [1,1,0,0,1,1,0,0] => [[.,[[.,.],.]],.] => [2,3,1,4] => 0
[1,0,1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [[[.,.],[.,.]],.] => [3,1,2,4] => 1
[1,0,1,1,0,0,1,0] => [1,1,0,0,1,0,1,0] => [[.,[.,[.,.]]],.] => [3,2,1,4] => 0
[1,0,1,1,0,1,0,0] => [1,1,0,1,0,0,1,0] => [[[.,[.,.]],.],.] => [2,1,3,4] => 0
[1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0] => [[[[.,.],.],.],.] => [1,2,3,4] => 0
[1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,0] => [[.,.],[[.,.],.]] => [3,4,1,2] => 1
[1,1,0,0,1,1,0,0] => [1,1,1,1,0,0,0,0] => [[[.,.],.],[.,.]] => [4,1,2,3] => 2
[1,1,0,1,0,0,1,0] => [1,1,1,0,0,0,1,0] => [[.,.],[.,[.,.]]] => [4,3,1,2] => 1
[1,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,0] => [.,[[.,[.,.]],.]] => [3,2,4,1] => 0
[1,1,0,1,1,0,0,0] => [1,0,1,1,0,1,0,0] => [.,[[[.,.],.],.]] => [2,3,4,1] => 0
[1,1,1,0,0,0,1,0] => [1,1,1,0,1,0,0,0] => [[.,[.,.]],[.,.]] => [4,2,1,3] => 1
[1,1,1,0,0,1,0,0] => [1,0,1,1,1,0,0,0] => [.,[[.,.],[.,.]]] => [4,2,3,1] => 1
[1,1,1,0,1,0,0,0] => [1,0,1,0,1,1,0,0] => [.,[.,[[.,.],.]]] => [3,4,2,1] => 0
[1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => [.,[.,[.,[.,.]]]] => [4,3,2,1] => 0
[1,0,1,0,1,0,1,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [[.,[[.,[.,.]],.]],.] => [3,2,4,1,5] => 0
[1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => [[[.,.],[.,[.,.]]],.] => [4,3,1,2,5] => 1
[1,0,1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,1,0,0] => [[.,[[[.,.],.],.]],.] => [2,3,4,1,5] => 0
[1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,1,0,0] => [[[.,.],[[.,.],.]],.] => [3,4,1,2,5] => 1
[1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [[[[.,.],.],[.,.]],.] => [4,1,2,3,5] => 2
[1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => [[.,[[.,.],[.,.]]],.] => [4,2,3,1,5] => 1
[1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [[[.,[.,.]],[.,.]],.] => [4,2,1,3,5] => 1
[1,0,1,1,0,1,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => [[.,[.,[[.,.],.]]],.] => [3,4,2,1,5] => 0
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,0,0,1,1,0,0] => [[[.,[[.,.],.]],.],.] => [2,3,1,4,5] => 0
[1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,0,1,1,0,0,0] => [[[[.,.],[.,.]],.],.] => [3,1,2,4,5] => 1
[1,0,1,1,1,0,0,0,1,0] => [1,1,0,0,1,0,1,0,1,0] => [[.,[.,[.,[.,.]]]],.] => [4,3,2,1,5] => 0
[1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => [[[.,[.,[.,.]]],.],.] => [3,2,1,4,5] => 0
[1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,0,0,1,0] => [[[[.,[.,.]],.],.],.] => [2,1,3,4,5] => 0
[1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => [[[[[.,.],.],.],.],.] => [1,2,3,4,5] => 0
[1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,0,1,0] => [[.,.],[[.,[.,.]],.]] => [4,3,5,1,2] => 1
[1,1,0,0,1,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => [[[.,.],.],[.,[.,.]]] => [5,4,1,2,3] => 2
[1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [[.,.],[[[.,.],.],.]] => [3,4,5,1,2] => 1
[1,1,0,0,1,1,0,1,0,0] => [1,1,1,1,0,0,0,1,0,0] => [[[.,.],.],[[.,.],.]] => [4,5,1,2,3] => 2
[1,1,0,0,1,1,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [[[[.,.],.],.],[.,.]] => [5,1,2,3,4] => 3
[1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,0,1,1,0,0,0] => [[.,.],[[.,.],[.,.]]] => [5,3,4,1,2] => 2
[1,1,0,1,0,0,1,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [[[.,[.,.]],.],[.,.]] => [5,2,1,3,4] => 2
[1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => [[.,.],[.,[[.,.],.]]] => [4,5,3,1,2] => 1
[1,1,0,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [.,[[.,[[.,.],.]],.]] => [3,4,2,5,1] => 0
[1,1,0,1,0,1,1,0,0,0] => [1,0,1,1,0,1,1,0,0,0] => [.,[[[.,.],[.,.]],.]] => [4,2,3,5,1] => 1
[1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,0,1,0] => [[.,.],[.,[.,[.,.]]]] => [5,4,3,1,2] => 1
[1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0] => [.,[[.,[.,[.,.]]],.]] => [4,3,2,5,1] => 0
[1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,0,1,0,0,1,0] => [.,[[[.,[.,.]],.],.]] => [3,2,4,5,1] => 0
[1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,0,1,0,1,0,0] => [.,[[[[.,.],.],.],.]] => [2,3,4,5,1] => 0
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,1,1,0,0,0,0] => [[.,[[.,.],.]],[.,.]] => [5,2,3,1,4] => 2
[1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,1,0,0,0,0,0] => [[[.,.],[.,.]],[.,.]] => [5,3,1,2,4] => 2
[1,1,1,0,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [[.,[.,.]],[[.,.],.]] => [4,5,2,1,3] => 1
[1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,1,0,0,1,0,0] => [.,[[.,.],[[.,.],.]]] => [4,5,2,3,1] => 1
[1,1,1,0,0,1,1,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [.,[[[.,.],.],[.,.]]] => [5,2,3,4,1] => 2
[1,1,1,0,1,0,0,0,1,0] => [1,1,1,0,1,0,0,0,1,0] => [[.,[.,.]],[.,[.,.]]] => [5,4,2,1,3] => 1
[1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => [.,[[.,.],[.,[.,.]]]] => [5,4,2,3,1] => 1
[1,1,1,0,1,0,1,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => [.,[.,[[.,[.,.]],.]]] => [4,3,5,2,1] => 0
[1,1,1,0,1,1,0,0,0,0] => [1,0,1,0,1,1,0,1,0,0] => [.,[.,[[[.,.],.],.]]] => [3,4,5,2,1] => 0
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,0,1,0,1,0,0,0] => [[.,[.,[.,.]]],[.,.]] => [5,3,2,1,4] => 1
[1,1,1,1,0,0,0,1,0,0] => [1,0,1,1,1,0,1,0,0,0] => [.,[[.,[.,.]],[.,.]]] => [5,3,2,4,1] => 1
[1,1,1,1,0,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [.,[.,[[.,.],[.,.]]]] => [5,3,4,2,1] => 1
[1,1,1,1,0,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0] => [.,[.,[.,[[.,.],.]]]] => [4,5,3,2,1] => 0
[1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => [.,[.,[.,[.,[.,.]]]]] => [5,4,3,2,1] => 0
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => [[.,[[.,[[.,.],.]],.]],.] => [3,4,2,5,1,6] => 0
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,1,0,0] => [[[.,.],[.,[[.,.],.]]],.] => [4,5,3,1,2,6] => 1
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,1,1,0,0,0] => [[.,[[[.,.],[.,.]],.]],.] => [4,2,3,5,1,6] => 1
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => [[[.,.],[[.,.],[.,.]]],.] => [5,3,4,1,2,6] => 2
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => [[[[.,[.,.]],.],[.,.]],.] => [5,2,1,3,4,6] => 2
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => [[.,[[.,[.,[.,.]]],.]],.] => [4,3,2,5,1,6] => 0
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0,1,0] => [[[.,.],[.,[.,[.,.]]]],.] => [5,4,3,1,2,6] => 1
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,0,0,1,1,0,1,0,0,1,0] => [[.,[[[.,[.,.]],.],.]],.] => [3,2,4,5,1,6] => 0
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,0,0,1,0,0,1,0] => [[[.,.],[[.,[.,.]],.]],.] => [4,3,5,1,2,6] => 1
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0,1,0] => [[[[.,.],.],[.,[.,.]]],.] => [5,4,1,2,3,6] => 2
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,0,0,1,1,0,1,0,1,0,0] => [[.,[[[[.,.],.],.],.]],.] => [2,3,4,5,1,6] => 0
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [[[.,.],[[[.,.],.],.]],.] => [3,4,5,1,2,6] => 1
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [[[[.,.],.],[[.,.],.]],.] => [4,5,1,2,3,6] => 2
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => [[[[[.,.],.],.],[.,.]],.] => [5,1,2,3,4,6] => 3
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,1,0,0] => [[.,[[.,.],[[.,.],.]]],.] => [4,5,2,3,1,6] => 1
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => [[[.,[.,.]],[[.,.],.]],.] => [4,5,2,1,3,6] => 1
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => [[.,[[[.,.],.],[.,.]]],.] => [5,2,3,4,1,6] => 2
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => [[[.,[[.,.],.]],[.,.]],.] => [5,2,3,1,4,6] => 2
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => [[[[.,.],[.,.]],[.,.]],.] => [5,3,1,2,4,6] => 2
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => [[.,[[.,.],[.,[.,.]]]],.] => [5,4,2,3,1,6] => 1
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,1,0,1,1,0,1,0,0,0,1,0] => [[[.,[.,.]],[.,[.,.]]],.] => [5,4,2,1,3,6] => 1
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => [[.,[.,[[.,[.,.]],.]]],.] => [4,3,5,2,1,6] => 0
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,0,1,0,0,1,1,0,0,1,0] => [[[.,[[.,[.,.]],.]],.],.] => [3,2,4,1,5,6] => 0
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,0,1,0,1,1,0,0,0,1,0] => [[[[.,.],[.,[.,.]]],.],.] => [4,3,1,2,5,6] => 1
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,1,0,0,1,0,1,1,0,1,0,0] => [[.,[.,[[[.,.],.],.]]],.] => [3,4,5,2,1,6] => 0
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,1,0,1,0,0] => [[[.,[[[.,.],.],.]],.],.] => [2,3,4,1,5,6] => 0
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => [[[[.,.],[[.,.],.]],.],.] => [3,4,1,2,5,6] => 1
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [[[[[.,.],.],[.,.]],.],.] => [4,1,2,3,5,6] => 2
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,1,0,0,0] => [[.,[[.,[.,.]],[.,.]]],.] => [5,3,2,4,1,6] => 1
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => [[[.,[.,[.,.]]],[.,.]],.] => [5,3,2,1,4,6] => 1
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,0,1,1,1,0,0,0] => [[.,[.,[[.,.],[.,.]]]],.] => [5,3,4,2,1,6] => 1
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,0,1,0,0,1,1,1,0,0,0] => [[[.,[[.,.],[.,.]]],.],.] => [4,2,3,1,5,6] => 1
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [[[[.,[.,.]],[.,.]],.],.] => [4,2,1,3,5,6] => 1
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,0,0,1,0,1,0,1,1,0,0] => [[.,[.,[.,[[.,.],.]]]],.] => [4,5,3,2,1,6] => 0
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,0,0,1,0,1,1,0,0] => [[[.,[.,[[.,.],.]]],.],.] => [3,4,2,1,5,6] => 0
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,0,1,0,0,1,1,0,0] => [[[[.,[[.,.],.]],.],.],.] => [2,3,1,4,5,6] => 0
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [[[[[.,.],[.,.]],.],.],.] => [3,1,2,4,5,6] => 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 occurrences of the pattern 31-2.
See Permutations/#Pattern-avoiding_permutations for the definition of the pattern 31−2.
See Permutations/#Pattern-avoiding_permutations for the definition of the pattern 31−2.
Map
Elizalde-Deutsch bijection
Description
The Elizalde-Deutsch bijection on Dyck paths.
.Let n be the length of the Dyck path. Consider the steps 1,n,2,n−1,… of D. When considering the i-th step its corresponding matching step has not yet been read, let the i-th step of the image of D be an up step, otherwise let it be a down step.
.Let n be the length of the Dyck path. Consider the steps 1,n,2,n−1,… of D. When considering the i-th step its corresponding matching step has not yet been read, let the i-th step of the image of D be an up step, otherwise let it be a down step.
Map
logarithmic height to pruning number
Description
Francon's map from Dyck paths to binary trees.
This bijection sends the logarithmic height of the Dyck path, St000920The logarithmic height of a Dyck path., to the pruning number of the binary tree, St000396The register function (or Horton-Strahler number) of a binary tree.. The implementation is a literal translation of Knuth's [2].
This bijection sends the logarithmic height of the Dyck path, St000920The logarithmic height of a Dyck path., to the pruning number of the binary tree, St000396The register function (or Horton-Strahler number) of a binary tree.. The implementation is a literal translation of Knuth's [2].
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!