Identifier
-
Mp00020:
Binary trees
—to Tamari-corresponding Dyck path⟶
Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00029: Dyck paths —to binary tree: left tree, up step, right tree, down step⟶ Binary trees
St000045: Binary trees ⟶ ℤ
Values
[.,[.,.]] => [1,1,0,0] => [1,1,1,0,0,0] => [.,[.,[.,.]]] => 1
[[.,.],.] => [1,0,1,0] => [1,1,0,1,0,0] => [.,[[.,.],.]] => 1
[.,[.,[.,.]]] => [1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [.,[.,[.,[.,.]]]] => 1
[.,[[.,.],.]] => [1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [.,[.,[[.,.],.]]] => 1
[[.,.],[.,.]] => [1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [.,[[.,.],[.,.]]] => 2
[[.,[.,.]],.] => [1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [.,[[.,[.,.]],.]] => 1
[[[.,.],.],.] => [1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [.,[[[.,.],.],.]] => 1
[.,[.,[.,[.,.]]]] => [1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [.,[.,[.,[.,[.,.]]]]] => 1
[.,[.,[[.,.],.]]] => [1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [.,[.,[.,[[.,.],.]]]] => 1
[.,[[.,.],[.,.]]] => [1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [.,[.,[[.,.],[.,.]]]] => 2
[.,[[.,[.,.]],.]] => [1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [.,[.,[[.,[.,.]],.]]] => 1
[.,[[[.,.],.],.]] => [1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [.,[.,[[[.,.],.],.]]] => 1
[[.,.],[.,[.,.]]] => [1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [.,[[.,.],[.,[.,.]]]] => 3
[[.,.],[[.,.],.]] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [.,[[.,.],[[.,.],.]]] => 3
[[.,[.,.]],[.,.]] => [1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [.,[[.,[.,.]],[.,.]]] => 3
[[[.,.],.],[.,.]] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [.,[[[.,.],.],[.,.]]] => 3
[[.,[.,[.,.]]],.] => [1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [.,[[.,[.,[.,.]]],.]] => 1
[[.,[[.,.],.]],.] => [1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [.,[[.,[[.,.],.]],.]] => 1
[[[.,.],[.,.]],.] => [1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [.,[[[.,.],[.,.]],.]] => 2
[[[.,[.,.]],.],.] => [1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [.,[[[.,[.,.]],.],.]] => 1
[[[[.,.],.],.],.] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [.,[[[[.,.],.],.],.]] => 1
[.,[.,[.,[.,[.,.]]]]] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [.,[.,[.,[.,[.,[.,.]]]]]] => 1
[.,[.,[.,[[.,.],.]]]] => [1,1,1,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => [.,[.,[.,[.,[[.,.],.]]]]] => 1
[.,[.,[[.,.],[.,.]]]] => [1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => [.,[.,[.,[[.,.],[.,.]]]]] => 2
[.,[.,[[.,[.,.]],.]]] => [1,1,1,1,0,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => [.,[.,[.,[[.,[.,.]],.]]]] => 1
[.,[.,[[[.,.],.],.]]] => [1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [.,[.,[.,[[[.,.],.],.]]]] => 1
[.,[[.,.],[.,[.,.]]]] => [1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => [.,[.,[[.,.],[.,[.,.]]]]] => 3
[.,[[.,.],[[.,.],.]]] => [1,1,0,1,1,0,1,0,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => [.,[.,[[.,.],[[.,.],.]]]] => 3
[.,[[.,[.,.]],[.,.]]] => [1,1,1,0,0,1,1,0,0,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => [.,[.,[[.,[.,.]],[.,.]]]] => 3
[.,[[[.,.],.],[.,.]]] => [1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => [.,[.,[[[.,.],.],[.,.]]]] => 3
[.,[[.,[.,[.,.]]],.]] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => [.,[.,[[.,[.,[.,.]]],.]]] => 1
[.,[[.,[[.,.],.]],.]] => [1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => [.,[.,[[.,[[.,.],.]],.]]] => 1
[.,[[[.,.],[.,.]],.]] => [1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => [.,[.,[[[.,.],[.,.]],.]]] => 2
[.,[[[.,[.,.]],.],.]] => [1,1,1,0,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => [.,[.,[[[.,[.,.]],.],.]]] => 1
[.,[[[[.,.],.],.],.]] => [1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [.,[.,[[[[.,.],.],.],.]]] => 1
[[.,.],[.,[.,[.,.]]]] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => [.,[[.,.],[.,[.,[.,.]]]]] => 4
[[.,.],[.,[[.,.],.]]] => [1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => [.,[[.,.],[.,[[.,.],.]]]] => 4
[[.,.],[[.,.],[.,.]]] => [1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => [.,[[.,.],[[.,.],[.,.]]]] => 8
[[.,.],[[.,[.,.]],.]] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => [.,[[.,.],[[.,[.,.]],.]]] => 4
[[.,.],[[[.,.],.],.]] => [1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => [.,[[.,.],[[[.,.],.],.]]] => 4
[[.,[.,.]],[.,[.,.]]] => [1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => [.,[[.,[.,.]],[.,[.,.]]]] => 6
[[.,[.,.]],[[.,.],.]] => [1,1,0,0,1,1,0,1,0,0] => [1,1,1,0,0,1,1,0,1,0,0,0] => [.,[[.,[.,.]],[[.,.],.]]] => 6
[[[.,.],.],[.,[.,.]]] => [1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [.,[[[.,.],.],[.,[.,.]]]] => 6
[[[.,.],.],[[.,.],.]] => [1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [.,[[[.,.],.],[[.,.],.]]] => 6
[[.,[.,[.,.]]],[.,.]] => [1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => [.,[[.,[.,[.,.]]],[.,.]]] => 4
[[.,[[.,.],.]],[.,.]] => [1,1,0,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => [.,[[.,[[.,.],.]],[.,.]]] => 4
[[[.,.],[.,.]],[.,.]] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => [.,[[[.,.],[.,.]],[.,.]]] => 8
[[[.,[.,.]],.],[.,.]] => [1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => [.,[[[.,[.,.]],.],[.,.]]] => 4
[[[[.,.],.],.],[.,.]] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [.,[[[[.,.],.],.],[.,.]]] => 4
[[.,[.,[.,[.,.]]]],.] => [1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [.,[[.,[.,[.,[.,.]]]],.]] => 1
[[.,[.,[[.,.],.]]],.] => [1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => [.,[[.,[.,[[.,.],.]]],.]] => 1
[[.,[[.,.],[.,.]]],.] => [1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => [.,[[.,[[.,.],[.,.]]],.]] => 2
[[.,[[.,[.,.]],.]],.] => [1,1,1,0,0,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => [.,[[.,[[.,[.,.]],.]],.]] => 1
[[.,[[[.,.],.],.]],.] => [1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => [.,[[.,[[[.,.],.],.]],.]] => 1
[[[.,.],[.,[.,.]]],.] => [1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [.,[[[.,.],[.,[.,.]]],.]] => 3
[[[.,.],[[.,.],.]],.] => [1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => [.,[[[.,.],[[.,.],.]],.]] => 3
[[[.,[.,.]],[.,.]],.] => [1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => [.,[[[.,[.,.]],[.,.]],.]] => 3
[[[[.,.],.],[.,.]],.] => [1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => [.,[[[[.,.],.],[.,.]],.]] => 3
[[[.,[.,[.,.]]],.],.] => [1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [.,[[[.,[.,[.,.]]],.],.]] => 1
[[[.,[[.,.],.]],.],.] => [1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => [.,[[[.,[[.,.],.]],.],.]] => 1
[[[[.,.],[.,.]],.],.] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [.,[[[[.,.],[.,.]],.],.]] => 2
[[[[.,[.,.]],.],.],.] => [1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [.,[[[[.,[.,.]],.],.],.]] => 1
[[[[[.,.],.],.],.],.] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [.,[[[[[.,.],.],.],.],.]] => 1
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 linear extensions of a binary tree.
Also, the number of increasing / decreasing binary trees labelled by $1, \dots, n$ of this shape.
Also, the size of the sylvester class corresponding to this tree when the Tamari order is seen as a quotient poset of the right weak order on permutations.
Also, the number of permutations which give this tree shape when inserted in a binary search tree.
Also, the number of permutations which increasing / decreasing tree is of this shape.
Also, the number of increasing / decreasing binary trees labelled by $1, \dots, n$ of this shape.
Also, the size of the sylvester class corresponding to this tree when the Tamari order is seen as a quotient poset of the right weak order on permutations.
Also, the number of permutations which give this tree shape when inserted in a binary search tree.
Also, the number of permutations which increasing / decreasing tree is of this shape.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
Map
to binary tree: left tree, up step, right tree, down step
Description
Return the binary tree corresponding to the Dyck path under the transformation left tree - up step - right tree - down step.
A Dyck path $D$ of semilength $n$ with $n > 1$ may be uniquely decomposed into $L 1 R 0$ for Dyck paths $L,R$ of respective semilengths $n_1,n_2$ with $n_1+n_2 = n-1$.
This map sends $D$ to the binary tree $T$ consisting of a root node with a left child according to $L$ and a right child according to $R$ and then recursively proceeds.
The base case of the unique Dyck path of semilength $1$ is sent to a single node.
This map may also be described as the unique map sending the Tamari orders on Dyck paths to the Tamari order on binary trees.
A Dyck path $D$ of semilength $n$ with $n > 1$ may be uniquely decomposed into $L 1 R 0$ for Dyck paths $L,R$ of respective semilengths $n_1,n_2$ with $n_1+n_2 = n-1$.
This map sends $D$ to the binary tree $T$ consisting of a root node with a left child according to $L$ and a right child according to $R$ and then recursively proceeds.
The base case of the unique Dyck path of semilength $1$ is sent to a single node.
This map may also be described as the unique map sending the Tamari orders on Dyck paths to the Tamari order on binary trees.
Map
to Tamari-corresponding Dyck path
Description
Return the Dyck path associated with a binary tree in consistency with the Tamari order on Dyck words and binary trees.
The bijection is defined recursively as follows:
The bijection is defined recursively as follows:
- a leaf is associated with an empty Dyck path,
- a tree with children $l,r$ is associated with the Dyck word $T(l) 1 T(r) 0$ where $T(l)$ and $T(r)$ are the images of this bijection to $l$ and $r$.
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!