- FindStat

Identifier

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

Values

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

$F_{1} = q$

$F_{2} = q + q^{2}$

$F_{3} = 4\ q + q^{3}$

$F_{4} = 11\ q + 2\ q^{2} + q^{4}$

$F_{5} = 36\ q + 5\ q^{2} + q^{5}$

$F_{6} = 117\ q + 11\ q^{2} + 3\ q^{3} + q^{6}$

$F_{7} = 393\ q + 28\ q^{2} + 7\ q^{3} + q^{7}$

Description

The length of the minimal rise of a Dyck path.
For the length of a maximal rise, see St000444The length of the maximal rise of a 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$ .