- FindStat

Identifier

Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St001037: Dyck paths ⟶ ℤ

Values

[.,.] => [1,0] => 0

[.,[.,.]] => [1,1,0,0] => 0

[[.,.],.] => [1,0,1,0] => 0

[.,[.,[.,.]]] => [1,1,1,0,0,0] => 0

[.,[[.,.],.]] => [1,1,0,1,0,0] => 0

[[.,.],[.,.]] => [1,0,1,1,0,0] => 1

[[.,[.,.]],.] => [1,1,0,0,1,0] => 0

[[[.,.],.],.] => [1,0,1,0,1,0] => 0

[.,[.,[.,[.,.]]]] => [1,1,1,1,0,0,0,0] => 0

[.,[.,[[.,.],.]]] => [1,1,1,0,1,0,0,0] => 0

[.,[[.,.],[.,.]]] => [1,1,0,1,1,0,0,0] => 0

[.,[[.,[.,.]],.]] => [1,1,1,0,0,1,0,0] => 1

[.,[[[.,.],.],.]] => [1,1,0,1,0,1,0,0] => 0

[[.,.],[.,[.,.]]] => [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] => 1

[[[.,.],.],[.,.]] => [1,0,1,0,1,1,0,0] => 1

[[.,[.,[.,.]]],.] => [1,1,1,0,0,0,1,0] => 0

[[.,[[.,.],.]],.] => [1,1,0,1,0,0,1,0] => 0

[[[.,.],[.,.]],.] => [1,0,1,1,0,0,1,0] => 1

[[[.,[.,.]],.],.] => [1,1,0,0,1,0,1,0] => 0

[[[[.,.],.],.],.] => [1,0,1,0,1,0,1,0] => 0

[.,[.,[.,[.,[.,.]]]]] => [1,1,1,1,1,0,0,0,0,0] => 0

[.,[.,[.,[[.,.],.]]]] => [1,1,1,1,0,1,0,0,0,0] => 0

[.,[.,[[.,.],[.,.]]]] => [1,1,1,0,1,1,0,0,0,0] => 1

[.,[.,[[.,[.,.]],.]]] => [1,1,1,1,0,0,1,0,0,0] => 0

[.,[.,[[[.,.],.],.]]] => [1,1,1,0,1,0,1,0,0,0] => 0

[.,[[.,.],[.,[.,.]]]] => [1,1,0,1,1,1,0,0,0,0] => 0

[.,[[.,.],[[.,.],.]]] => [1,1,0,1,1,0,1,0,0,0] => 0

[.,[[.,[.,.]],[.,.]]] => [1,1,1,0,0,1,1,0,0,0] => 1

[.,[[[.,.],.],[.,.]]] => [1,1,0,1,0,1,1,0,0,0] => 0

[.,[[.,[.,[.,.]]],.]] => [1,1,1,1,0,0,0,1,0,0] => 1

[.,[[.,[[.,.],.]],.]] => [1,1,1,0,1,0,0,1,0,0] => 1

[.,[[[.,.],[.,.]],.]] => [1,1,0,1,1,0,0,1,0,0] => 1

[.,[[[.,[.,.]],.],.]] => [1,1,1,0,0,1,0,1,0,0] => 1

[.,[[[[.,.],.],.],.]] => [1,1,0,1,0,1,0,1,0,0] => 0

[[.,.],[.,[.,[.,.]]]] => [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] => 1

[[.,.],[[.,[.,.]],.]] => [1,0,1,1,1,0,0,1,0,0] => 2

[[.,.],[[[.,.],.],.]] => [1,0,1,1,0,1,0,1,0,0] => 1

[[.,[.,.]],[.,[.,.]]] => [1,1,0,0,1,1,1,0,0,0] => 1

[[.,[.,.]],[[.,.],.]] => [1,1,0,0,1,1,0,1,0,0] => 1

[[[.,.],.],[.,[.,.]]] => [1,0,1,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,0,0] => 1

[[.,[[.,.],.]],[.,.]] => [1,1,0,1,0,0,1,1,0,0] => 1

[[[.,.],[.,.]],[.,.]] => [1,0,1,1,0,0,1,1,0,0] => 2

[[[.,[.,.]],.],[.,.]] => [1,1,0,0,1,0,1,1,0,0] => 1

[[[[.,.],.],.],[.,.]] => [1,0,1,0,1,0,1,1,0,0] => 1

[[.,[.,[.,[.,.]]]],.] => [1,1,1,1,0,0,0,0,1,0] => 0

[[.,[.,[[.,.],.]]],.] => [1,1,1,0,1,0,0,0,1,0] => 0

[[.,[[.,.],[.,.]]],.] => [1,1,0,1,1,0,0,0,1,0] => 0

[[.,[[.,[.,.]],.]],.] => [1,1,1,0,0,1,0,0,1,0] => 1

[[.,[[[.,.],.],.]],.] => [1,1,0,1,0,1,0,0,1,0] => 0

[[[.,.],[.,[.,.]]],.] => [1,0,1,1,1,0,0,0,1,0] => 1

[[[.,.],[[.,.],.]],.] => [1,0,1,1,0,1,0,0,1,0] => 1

[[[.,[.,.]],[.,.]],.] => [1,1,0,0,1,1,0,0,1,0] => 1

[[[[.,.],.],[.,.]],.] => [1,0,1,0,1,1,0,0,1,0] => 1

[[[.,[.,[.,.]]],.],.] => [1,1,1,0,0,0,1,0,1,0] => 0

[[[.,[[.,.],.]],.],.] => [1,1,0,1,0,0,1,0,1,0] => 0

[[[[.,.],[.,.]],.],.] => [1,0,1,1,0,0,1,0,1,0] => 1

[[[[.,[.,.]],.],.],.] => [1,1,0,0,1,0,1,0,1,0] => 0

[[[[[.,.],.],.],.],.] => [1,0,1,0,1,0,1,0,1,0] => 0

[.,[.,[.,[.,[.,[.,.]]]]]] => [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] => 0

[.,[.,[.,[[.,.],[.,.]]]]] => [1,1,1,1,0,1,1,0,0,0,0,0] => 0

[.,[.,[.,[[.,[.,.]],.]]]] => [1,1,1,1,1,0,0,1,0,0,0,0] => 1

[.,[.,[.,[[[.,.],.],.]]]] => [1,1,1,1,0,1,0,1,0,0,0,0] => 0

[.,[.,[[.,.],[.,[.,.]]]]] => [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] => 1

[.,[.,[[[.,.],.],[.,.]]]] => [1,1,1,0,1,0,1,1,0,0,0,0] => 1

[.,[.,[[.,[.,[.,.]]],.]]] => [1,1,1,1,1,0,0,0,1,0,0,0] => 0

[.,[.,[[.,[[.,.],.]],.]]] => [1,1,1,1,0,1,0,0,1,0,0,0] => 0

[.,[.,[[[.,.],[.,.]],.]]] => [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] => 0

[.,[.,[[[[.,.],.],.],.]]] => [1,1,1,0,1,0,1,0,1,0,0,0] => 0

[.,[[.,.],[.,[.,[.,.]]]]] => [1,1,0,1,1,1,1,0,0,0,0,0] => 0

[.,[[.,.],[.,[[.,.],.]]]] => [1,1,0,1,1,1,0,1,0,0,0,0] => 0

[.,[[.,.],[[.,.],[.,.]]]] => [1,1,0,1,1,0,1,1,0,0,0,0] => 1

[.,[[.,.],[[.,[.,.]],.]]] => [1,1,0,1,1,1,0,0,1,0,0,0] => 0

[.,[[.,.],[[[.,.],.],.]]] => [1,1,0,1,1,0,1,0,1,0,0,0] => 0

[.,[[.,[.,.]],[.,[.,.]]]] => [1,1,1,0,0,1,1,1,0,0,0,0] => 1

[.,[[.,[.,.]],[[.,.],.]]] => [1,1,1,0,0,1,1,0,1,0,0,0] => 1

[.,[[[.,.],.],[.,[.,.]]]] => [1,1,0,1,0,1,1,1,0,0,0,0] => 0

[.,[[[.,.],.],[[.,.],.]]] => [1,1,0,1,0,1,1,0,1,0,0,0] => 0

[.,[[.,[.,[.,.]]],[.,.]]] => [1,1,1,1,0,0,0,1,1,0,0,0] => 1

[.,[[.,[[.,.],.]],[.,.]]] => [1,1,1,0,1,0,0,1,1,0,0,0] => 1

[.,[[[.,.],[.,.]],[.,.]]] => [1,1,0,1,1,0,0,1,1,0,0,0] => 1

[.,[[[.,[.,.]],.],[.,.]]] => [1,1,1,0,0,1,0,1,1,0,0,0] => 1

[.,[[[[.,.],.],.],[.,.]]] => [1,1,0,1,0,1,0,1,1,0,0,0] => 0

[.,[[.,[.,[.,[.,.]]]],.]] => [1,1,1,1,1,0,0,0,0,1,0,0] => 1

[.,[[.,[.,[[.,.],.]]],.]] => [1,1,1,1,0,1,0,0,0,1,0,0] => 1

[.,[[.,[[.,.],[.,.]]],.]] => [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] => 1

[.,[[.,[[[.,.],.],.]],.]] => [1,1,1,0,1,0,1,0,0,1,0,0] => 1

[.,[[[.,.],[.,[.,.]]],.]] => [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] => 1

[.,[[[.,[.,.]],[.,.]],.]] => [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] => 1

>>> Load all 1200 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

click to show known generating functions

Description

The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path.

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:

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$.