Identifier
-
Mp00012:
Binary trees
—to Dyck path: up step, left tree, down step, right tree⟶
Dyck paths
St001237: Dyck paths ⟶ ℤ
Values
[.,.] => [1,0] => 2
[.,[.,.]] => [1,0,1,0] => 3
[[.,.],.] => [1,1,0,0] => 3
[.,[.,[.,.]]] => [1,0,1,0,1,0] => 4
[.,[[.,.],.]] => [1,0,1,1,0,0] => 4
[[.,.],[.,.]] => [1,1,0,0,1,0] => 3
[[.,[.,.]],.] => [1,1,0,1,0,0] => 4
[[[.,.],.],.] => [1,1,1,0,0,0] => 4
[.,[.,[.,[.,.]]]] => [1,0,1,0,1,0,1,0] => 5
[.,[.,[[.,.],.]]] => [1,0,1,0,1,1,0,0] => 5
[.,[[.,.],[.,.]]] => [1,0,1,1,0,0,1,0] => 4
[.,[[.,[.,.]],.]] => [1,0,1,1,0,1,0,0] => 5
[.,[[[.,.],.],.]] => [1,0,1,1,1,0,0,0] => 5
[[.,.],[.,[.,.]]] => [1,1,0,0,1,0,1,0] => 4
[[.,.],[[.,.],.]] => [1,1,0,0,1,1,0,0] => 4
[[.,[.,.]],[.,.]] => [1,1,0,1,0,0,1,0] => 4
[[[.,.],.],[.,.]] => [1,1,1,0,0,0,1,0] => 4
[[.,[.,[.,.]]],.] => [1,1,0,1,0,1,0,0] => 5
[[.,[[.,.],.]],.] => [1,1,0,1,1,0,0,0] => 5
[[[.,.],[.,.]],.] => [1,1,1,0,0,1,0,0] => 4
[[[.,[.,.]],.],.] => [1,1,1,0,1,0,0,0] => 5
[[[[.,.],.],.],.] => [1,1,1,1,0,0,0,0] => 5
[.,[.,[.,[.,[.,.]]]]] => [1,0,1,0,1,0,1,0,1,0] => 6
[.,[.,[.,[[.,.],.]]]] => [1,0,1,0,1,0,1,1,0,0] => 6
[.,[.,[[.,.],[.,.]]]] => [1,0,1,0,1,1,0,0,1,0] => 5
[.,[.,[[.,[.,.]],.]]] => [1,0,1,0,1,1,0,1,0,0] => 6
[.,[.,[[[.,.],.],.]]] => [1,0,1,0,1,1,1,0,0,0] => 6
[.,[[.,.],[.,[.,.]]]] => [1,0,1,1,0,0,1,0,1,0] => 5
[.,[[.,.],[[.,.],.]]] => [1,0,1,1,0,0,1,1,0,0] => 5
[.,[[.,[.,.]],[.,.]]] => [1,0,1,1,0,1,0,0,1,0] => 5
[.,[[[.,.],.],[.,.]]] => [1,0,1,1,1,0,0,0,1,0] => 5
[.,[[.,[.,[.,.]]],.]] => [1,0,1,1,0,1,0,1,0,0] => 6
[.,[[.,[[.,.],.]],.]] => [1,0,1,1,0,1,1,0,0,0] => 6
[.,[[[.,.],[.,.]],.]] => [1,0,1,1,1,0,0,1,0,0] => 5
[.,[[[.,[.,.]],.],.]] => [1,0,1,1,1,0,1,0,0,0] => 6
[.,[[[[.,.],.],.],.]] => [1,0,1,1,1,1,0,0,0,0] => 6
[[.,.],[.,[.,[.,.]]]] => [1,1,0,0,1,0,1,0,1,0] => 5
[[.,.],[.,[[.,.],.]]] => [1,1,0,0,1,0,1,1,0,0] => 5
[[.,.],[[.,.],[.,.]]] => [1,1,0,0,1,1,0,0,1,0] => 4
[[.,.],[[.,[.,.]],.]] => [1,1,0,0,1,1,0,1,0,0] => 5
[[.,.],[[[.,.],.],.]] => [1,1,0,0,1,1,1,0,0,0] => 5
[[.,[.,.]],[.,[.,.]]] => [1,1,0,1,0,0,1,0,1,0] => 5
[[.,[.,.]],[[.,.],.]] => [1,1,0,1,0,0,1,1,0,0] => 5
[[[.,.],.],[.,[.,.]]] => [1,1,1,0,0,0,1,0,1,0] => 5
[[[.,.],.],[[.,.],.]] => [1,1,1,0,0,0,1,1,0,0] => 5
[[.,[.,[.,.]]],[.,.]] => [1,1,0,1,0,1,0,0,1,0] => 5
[[.,[[.,.],.]],[.,.]] => [1,1,0,1,1,0,0,0,1,0] => 5
[[[.,.],[.,.]],[.,.]] => [1,1,1,0,0,1,0,0,1,0] => 4
[[[.,[.,.]],.],[.,.]] => [1,1,1,0,1,0,0,0,1,0] => 5
[[[[.,.],.],.],[.,.]] => [1,1,1,1,0,0,0,0,1,0] => 5
[[.,[.,[.,[.,.]]]],.] => [1,1,0,1,0,1,0,1,0,0] => 6
[[.,[.,[[.,.],.]]],.] => [1,1,0,1,0,1,1,0,0,0] => 6
[[.,[[.,.],[.,.]]],.] => [1,1,0,1,1,0,0,1,0,0] => 5
[[.,[[.,[.,.]],.]],.] => [1,1,0,1,1,0,1,0,0,0] => 6
[[.,[[[.,.],.],.]],.] => [1,1,0,1,1,1,0,0,0,0] => 6
[[[.,.],[.,[.,.]]],.] => [1,1,1,0,0,1,0,1,0,0] => 5
[[[.,.],[[.,.],.]],.] => [1,1,1,0,0,1,1,0,0,0] => 5
[[[.,[.,.]],[.,.]],.] => [1,1,1,0,1,0,0,1,0,0] => 5
[[[[.,.],.],[.,.]],.] => [1,1,1,1,0,0,0,1,0,0] => 5
[[[.,[.,[.,.]]],.],.] => [1,1,1,0,1,0,1,0,0,0] => 6
[[[.,[[.,.],.]],.],.] => [1,1,1,0,1,1,0,0,0,0] => 6
[[[[.,.],[.,.]],.],.] => [1,1,1,1,0,0,1,0,0,0] => 5
[[[[.,[.,.]],.],.],.] => [1,1,1,1,0,1,0,0,0,0] => 6
[[[[[.,.],.],.],.],.] => [1,1,1,1,1,0,0,0,0,0] => 6
[.,[.,[.,[.,[.,[.,.]]]]]] => [1,0,1,0,1,0,1,0,1,0,1,0] => 7
[.,[.,[.,[.,[[.,.],.]]]]] => [1,0,1,0,1,0,1,0,1,1,0,0] => 7
[.,[.,[.,[[.,.],[.,.]]]]] => [1,0,1,0,1,0,1,1,0,0,1,0] => 6
[.,[.,[.,[[.,[.,.]],.]]]] => [1,0,1,0,1,0,1,1,0,1,0,0] => 7
[.,[.,[.,[[[.,.],.],.]]]] => [1,0,1,0,1,0,1,1,1,0,0,0] => 7
[.,[.,[[.,.],[.,[.,.]]]]] => [1,0,1,0,1,1,0,0,1,0,1,0] => 6
[.,[.,[[.,.],[[.,.],.]]]] => [1,0,1,0,1,1,0,0,1,1,0,0] => 6
[.,[.,[[.,[.,.]],[.,.]]]] => [1,0,1,0,1,1,0,1,0,0,1,0] => 6
[.,[.,[[[.,.],.],[.,.]]]] => [1,0,1,0,1,1,1,0,0,0,1,0] => 6
[.,[.,[[.,[.,[.,.]]],.]]] => [1,0,1,0,1,1,0,1,0,1,0,0] => 7
[.,[.,[[.,[[.,.],.]],.]]] => [1,0,1,0,1,1,0,1,1,0,0,0] => 7
[.,[.,[[[.,.],[.,.]],.]]] => [1,0,1,0,1,1,1,0,0,1,0,0] => 6
[.,[.,[[[.,[.,.]],.],.]]] => [1,0,1,0,1,1,1,0,1,0,0,0] => 7
[.,[.,[[[[.,.],.],.],.]]] => [1,0,1,0,1,1,1,1,0,0,0,0] => 7
[.,[[.,.],[.,[.,[.,.]]]]] => [1,0,1,1,0,0,1,0,1,0,1,0] => 6
[.,[[.,.],[.,[[.,.],.]]]] => [1,0,1,1,0,0,1,0,1,1,0,0] => 6
[.,[[.,.],[[.,.],[.,.]]]] => [1,0,1,1,0,0,1,1,0,0,1,0] => 5
[.,[[.,.],[[.,[.,.]],.]]] => [1,0,1,1,0,0,1,1,0,1,0,0] => 6
[.,[[.,.],[[[.,.],.],.]]] => [1,0,1,1,0,0,1,1,1,0,0,0] => 6
[.,[[.,[.,.]],[.,[.,.]]]] => [1,0,1,1,0,1,0,0,1,0,1,0] => 6
[.,[[.,[.,.]],[[.,.],.]]] => [1,0,1,1,0,1,0,0,1,1,0,0] => 6
[.,[[[.,.],.],[.,[.,.]]]] => [1,0,1,1,1,0,0,0,1,0,1,0] => 6
[.,[[[.,.],.],[[.,.],.]]] => [1,0,1,1,1,0,0,0,1,1,0,0] => 6
[.,[[.,[.,[.,.]]],[.,.]]] => [1,0,1,1,0,1,0,1,0,0,1,0] => 6
[.,[[.,[[.,.],.]],[.,.]]] => [1,0,1,1,0,1,1,0,0,0,1,0] => 6
[.,[[[.,.],[.,.]],[.,.]]] => [1,0,1,1,1,0,0,1,0,0,1,0] => 5
[.,[[[.,[.,.]],.],[.,.]]] => [1,0,1,1,1,0,1,0,0,0,1,0] => 6
[.,[[[[.,.],.],.],[.,.]]] => [1,0,1,1,1,1,0,0,0,0,1,0] => 6
[.,[[.,[.,[.,[.,.]]]],.]] => [1,0,1,1,0,1,0,1,0,1,0,0] => 7
[.,[[.,[.,[[.,.],.]]],.]] => [1,0,1,1,0,1,0,1,1,0,0,0] => 7
[.,[[.,[[.,.],[.,.]]],.]] => [1,0,1,1,0,1,1,0,0,1,0,0] => 6
[.,[[.,[[.,[.,.]],.]],.]] => [1,0,1,1,0,1,1,0,1,0,0,0] => 7
[.,[[.,[[[.,.],.],.]],.]] => [1,0,1,1,0,1,1,1,0,0,0,0] => 7
[.,[[[.,.],[.,[.,.]]],.]] => [1,0,1,1,1,0,0,1,0,1,0,0] => 6
[.,[[[.,.],[[.,.],.]],.]] => [1,0,1,1,1,0,0,1,1,0,0,0] => 6
[.,[[[.,[.,.]],[.,.]],.]] => [1,0,1,1,1,0,1,0,0,1,0,0] => 6
[.,[[[[.,.],.],[.,.]],.]] => [1,0,1,1,1,1,0,0,0,1,0,0] => 6
>>> 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 simple modules with injective dimension at most one or dominant dimension at least one.
Map
to Dyck path: up step, left tree, down step, right tree
Description
Return the associated Dyck path, using the bijection 1L0R.
This is given recursively as follows:
This is given recursively as follows:
- a leaf is associated to the empty Dyck Word
- a tree with children $l,r$ is associated with the Dyck path described by 1L0R where $L$ and $R$ are respectively the Dyck words associated with the trees $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!