Identifier
-
Mp00020:
Binary trees
—to Tamari-corresponding Dyck path⟶
Dyck paths
St000120: Dyck paths ⟶ ℤ
Values
[.,.] => [1,0] => 0
[.,[.,.]] => [1,1,0,0] => 0
[[.,.],.] => [1,0,1,0] => 1
[.,[.,[.,.]]] => [1,1,1,0,0,0] => 0
[.,[[.,.],.]] => [1,1,0,1,0,0] => 1
[[.,.],[.,.]] => [1,0,1,1,0,0] => 1
[[.,[.,.]],.] => [1,1,0,0,1,0] => 2
[[[.,.],.],.] => [1,0,1,0,1,0] => 1
[.,[.,[.,[.,.]]]] => [1,1,1,1,0,0,0,0] => 0
[.,[.,[[.,.],.]]] => [1,1,1,0,1,0,0,0] => 1
[.,[[.,.],[.,.]]] => [1,1,0,1,1,0,0,0] => 1
[.,[[.,[.,.]],.]] => [1,1,1,0,0,1,0,0] => 2
[.,[[[.,.],.],.]] => [1,1,0,1,0,1,0,0] => 1
[[.,.],[.,[.,.]]] => [1,0,1,1,1,0,0,0] => 1
[[.,.],[[.,.],.]] => [1,0,1,1,0,1,0,0] => 1
[[.,[.,.]],[.,.]] => [1,1,0,0,1,1,0,0] => 2
[[[.,.],.],[.,.]] => [1,0,1,0,1,1,0,0] => 2
[[.,[.,[.,.]]],.] => [1,1,1,0,0,0,1,0] => 3
[[.,[[.,.],.]],.] => [1,1,0,1,0,0,1,0] => 2
[[[.,.],[.,.]],.] => [1,0,1,1,0,0,1,0] => 1
[[[.,[.,.]],.],.] => [1,1,0,0,1,0,1,0] => 2
[[[[.,.],.],.],.] => [1,0,1,0,1,0,1,0] => 2
[.,[.,[.,[.,[.,.]]]]] => [1,1,1,1,1,0,0,0,0,0] => 0
[.,[.,[.,[[.,.],.]]]] => [1,1,1,1,0,1,0,0,0,0] => 1
[.,[.,[[.,.],[.,.]]]] => [1,1,1,0,1,1,0,0,0,0] => 1
[.,[.,[[.,[.,.]],.]]] => [1,1,1,1,0,0,1,0,0,0] => 2
[.,[.,[[[.,.],.],.]]] => [1,1,1,0,1,0,1,0,0,0] => 1
[.,[[.,.],[.,[.,.]]]] => [1,1,0,1,1,1,0,0,0,0] => 1
[.,[[.,.],[[.,.],.]]] => [1,1,0,1,1,0,1,0,0,0] => 1
[.,[[.,[.,.]],[.,.]]] => [1,1,1,0,0,1,1,0,0,0] => 2
[.,[[[.,.],.],[.,.]]] => [1,1,0,1,0,1,1,0,0,0] => 2
[.,[[.,[.,[.,.]]],.]] => [1,1,1,1,0,0,0,1,0,0] => 3
[.,[[.,[[.,.],.]],.]] => [1,1,1,0,1,0,0,1,0,0] => 2
[.,[[[.,.],[.,.]],.]] => [1,1,0,1,1,0,0,1,0,0] => 1
[.,[[[.,[.,.]],.],.]] => [1,1,1,0,0,1,0,1,0,0] => 2
[.,[[[[.,.],.],.],.]] => [1,1,0,1,0,1,0,1,0,0] => 2
[[.,.],[.,[.,[.,.]]]] => [1,0,1,1,1,1,0,0,0,0] => 1
[[.,.],[.,[[.,.],.]]] => [1,0,1,1,1,0,1,0,0,0] => 1
[[.,.],[[.,.],[.,.]]] => [1,0,1,1,0,1,1,0,0,0] => 2
[[.,.],[[.,[.,.]],.]] => [1,0,1,1,1,0,0,1,0,0] => 1
[[.,.],[[[.,.],.],.]] => [1,0,1,1,0,1,0,1,0,0] => 2
[[.,[.,.]],[.,[.,.]]] => [1,1,0,0,1,1,1,0,0,0] => 2
[[.,[.,.]],[[.,.],.]] => [1,1,0,0,1,1,0,1,0,0] => 2
[[[.,.],.],[.,[.,.]]] => [1,0,1,0,1,1,1,0,0,0] => 2
[[[.,.],.],[[.,.],.]] => [1,0,1,0,1,1,0,1,0,0] => 2
[[.,[.,[.,.]]],[.,.]] => [1,1,1,0,0,0,1,1,0,0] => 3
[[.,[[.,.],.]],[.,.]] => [1,1,0,1,0,0,1,1,0,0] => 3
[[[.,.],[.,.]],[.,.]] => [1,0,1,1,0,0,1,1,0,0] => 3
[[[.,[.,.]],.],[.,.]] => [1,1,0,0,1,0,1,1,0,0] => 2
[[[[.,.],.],.],[.,.]] => [1,0,1,0,1,0,1,1,0,0] => 2
[[.,[.,[.,[.,.]]]],.] => [1,1,1,1,0,0,0,0,1,0] => 4
[[.,[.,[[.,.],.]]],.] => [1,1,1,0,1,0,0,0,1,0] => 3
[[.,[[.,.],[.,.]]],.] => [1,1,0,1,1,0,0,0,1,0] => 2
[[.,[[.,[.,.]],.]],.] => [1,1,1,0,0,1,0,0,1,0] => 3
[[.,[[[.,.],.],.]],.] => [1,1,0,1,0,1,0,0,1,0] => 3
[[[.,.],[.,[.,.]]],.] => [1,0,1,1,1,0,0,0,1,0] => 1
[[[.,.],[[.,.],.]],.] => [1,0,1,1,0,1,0,0,1,0] => 2
[[[.,[.,.]],[.,.]],.] => [1,1,0,0,1,1,0,0,1,0] => 2
[[[[.,.],.],[.,.]],.] => [1,0,1,0,1,1,0,0,1,0] => 2
[[[.,[.,[.,.]]],.],.] => [1,1,1,0,0,0,1,0,1,0] => 3
[[[.,[[.,.],.]],.],.] => [1,1,0,1,0,0,1,0,1,0] => 3
[[[[.,.],[.,.]],.],.] => [1,0,1,1,0,0,1,0,1,0] => 3
[[[[.,[.,.]],.],.],.] => [1,1,0,0,1,0,1,0,1,0] => 2
[[[[[.,.],.],.],.],.] => [1,0,1,0,1,0,1,0,1,0] => 2
[.,[.,[.,[.,[.,[.,.]]]]]] => [1,1,1,1,1,1,0,0,0,0,0,0] => 0
[.,[.,[.,[.,[[.,.],.]]]]] => [1,1,1,1,1,0,1,0,0,0,0,0] => 1
[.,[.,[.,[[.,.],[.,.]]]]] => [1,1,1,1,0,1,1,0,0,0,0,0] => 1
[.,[.,[.,[[.,[.,.]],.]]]] => [1,1,1,1,1,0,0,1,0,0,0,0] => 2
[.,[.,[.,[[[.,.],.],.]]]] => [1,1,1,1,0,1,0,1,0,0,0,0] => 1
[.,[.,[[.,.],[.,[.,.]]]]] => [1,1,1,0,1,1,1,0,0,0,0,0] => 1
[.,[.,[[.,.],[[.,.],.]]]] => [1,1,1,0,1,1,0,1,0,0,0,0] => 1
[.,[.,[[.,[.,.]],[.,.]]]] => [1,1,1,1,0,0,1,1,0,0,0,0] => 2
[.,[.,[[[.,.],.],[.,.]]]] => [1,1,1,0,1,0,1,1,0,0,0,0] => 2
[.,[.,[[.,[.,[.,.]]],.]]] => [1,1,1,1,1,0,0,0,1,0,0,0] => 3
[.,[.,[[.,[[.,.],.]],.]]] => [1,1,1,1,0,1,0,0,1,0,0,0] => 2
[.,[.,[[[.,.],[.,.]],.]]] => [1,1,1,0,1,1,0,0,1,0,0,0] => 1
[.,[.,[[[.,[.,.]],.],.]]] => [1,1,1,1,0,0,1,0,1,0,0,0] => 2
[.,[.,[[[[.,.],.],.],.]]] => [1,1,1,0,1,0,1,0,1,0,0,0] => 2
[.,[[.,.],[.,[.,[.,.]]]]] => [1,1,0,1,1,1,1,0,0,0,0,0] => 1
[.,[[.,.],[.,[[.,.],.]]]] => [1,1,0,1,1,1,0,1,0,0,0,0] => 1
[.,[[.,.],[[.,.],[.,.]]]] => [1,1,0,1,1,0,1,1,0,0,0,0] => 2
[.,[[.,.],[[.,[.,.]],.]]] => [1,1,0,1,1,1,0,0,1,0,0,0] => 1
[.,[[.,.],[[[.,.],.],.]]] => [1,1,0,1,1,0,1,0,1,0,0,0] => 2
[.,[[.,[.,.]],[.,[.,.]]]] => [1,1,1,0,0,1,1,1,0,0,0,0] => 2
[.,[[.,[.,.]],[[.,.],.]]] => [1,1,1,0,0,1,1,0,1,0,0,0] => 2
[.,[[[.,.],.],[.,[.,.]]]] => [1,1,0,1,0,1,1,1,0,0,0,0] => 2
[.,[[[.,.],.],[[.,.],.]]] => [1,1,0,1,0,1,1,0,1,0,0,0] => 2
[.,[[.,[.,[.,.]]],[.,.]]] => [1,1,1,1,0,0,0,1,1,0,0,0] => 3
[.,[[.,[[.,.],.]],[.,.]]] => [1,1,1,0,1,0,0,1,1,0,0,0] => 3
[.,[[[.,.],[.,.]],[.,.]]] => [1,1,0,1,1,0,0,1,1,0,0,0] => 3
[.,[[[.,[.,.]],.],[.,.]]] => [1,1,1,0,0,1,0,1,1,0,0,0] => 2
[.,[[[[.,.],.],.],[.,.]]] => [1,1,0,1,0,1,0,1,1,0,0,0] => 2
[.,[[.,[.,[.,[.,.]]]],.]] => [1,1,1,1,1,0,0,0,0,1,0,0] => 4
[.,[[.,[.,[[.,.],.]]],.]] => [1,1,1,1,0,1,0,0,0,1,0,0] => 3
[.,[[.,[[.,.],[.,.]]],.]] => [1,1,1,0,1,1,0,0,0,1,0,0] => 2
[.,[[.,[[.,[.,.]],.]],.]] => [1,1,1,1,0,0,1,0,0,1,0,0] => 3
[.,[[.,[[[.,.],.],.]],.]] => [1,1,1,0,1,0,1,0,0,1,0,0] => 3
[.,[[[.,.],[.,[.,.]]],.]] => [1,1,0,1,1,1,0,0,0,1,0,0] => 1
[.,[[[.,.],[[.,.],.]],.]] => [1,1,0,1,1,0,1,0,0,1,0,0] => 2
[.,[[[.,[.,.]],[.,.]],.]] => [1,1,1,0,0,1,1,0,0,1,0,0] => 2
[.,[[[[.,.],.],[.,.]],.]] => [1,1,0,1,0,1,1,0,0,1,0,0] => 2
>>> Load all 196 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 left tunnels of a Dyck path.
A tunnel is a pair (a,b) where a is the position of an open parenthesis and b is the position of the matching close parenthesis. If a+b<n then the tunnel is called left.
A tunnel is a pair (a,b) where a is the position of an open parenthesis and b is the position of the matching close parenthesis. If a+b<n then the tunnel is called left.
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!