Identifier
-
Mp00020:
Binary trees
—to Tamari-corresponding Dyck path⟶
Dyck paths
St001188: Dyck paths ⟶ ℤ (values match St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path.)
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] => 1
[[[.,.],.],.] => [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] => 1
[.,[[[.,.],.],.]] => [1,1,0,1,0,1,0,0] => 2
[[.,.],[.,[.,.]]] => [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] => 1
[[.,[[.,.],.]],.] => [1,1,0,1,0,0,1,0] => 1
[[[.,.],[.,.]],.] => [1,0,1,1,0,0,1,0] => 2
[[[.,[.,.]],.],.] => [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] => 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] => 1
[.,[.,[[[.,.],.],.]]] => [1,1,1,0,1,0,1,0,0,0] => 2
[.,[[.,.],[.,[.,.]]]] => [1,1,0,1,1,1,0,0,0,0] => 1
[.,[[.,.],[[.,.],.]]] => [1,1,0,1,1,0,1,0,0,0] => 2
[.,[[.,[.,.]],[.,.]]] => [1,1,1,0,0,1,1,0,0,0] => 1
[.,[[[.,.],.],[.,.]]] => [1,1,0,1,0,1,1,0,0,0] => 2
[.,[[.,[.,[.,.]]],.]] => [1,1,1,1,0,0,0,1,0,0] => 1
[.,[[.,[[.,.],.]],.]] => [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] => 1
[[.,.],[[.,[.,.]],.]] => [1,0,1,1,1,0,0,1,0,0] => 2
[[.,.],[[[.,.],.],.]] => [1,0,1,1,0,1,0,1,0,0] => 2
[[.,[.,.]],[.,[.,.]]] => [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] => 1
[[.,[.,[[.,.],.]]],.] => [1,1,1,0,1,0,0,0,1,0] => 1
[[.,[[.,.],[.,.]]],.] => [1,1,0,1,1,0,0,0,1,0] => 2
[[.,[[.,[.,.]],.]],.] => [1,1,1,0,0,1,0,0,1,0] => 1
[[.,[[[.,.],.],.]],.] => [1,1,0,1,0,1,0,0,1,0] => 2
[[[.,.],[.,[.,.]]],.] => [1,0,1,1,1,0,0,0,1,0] => 2
[[[.,.],[[.,.],.]],.] => [1,0,1,1,0,1,0,0,1,0] => 1
[[[.,[.,.]],[.,.]],.] => [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] => 1
[[[.,[[.,.],.]],.],.] => [1,1,0,1,0,0,1,0,1,0] => 1
[[[[.,.],[.,.]],.],.] => [1,0,1,1,0,0,1,0,1,0] => 2
[[[[.,[.,.]],.],.],.] => [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] => 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] => 1
[.,[.,[.,[[[.,.],.],.]]]] => [1,1,1,1,0,1,0,1,0,0,0,0] => 2
[.,[.,[[.,.],[.,[.,.]]]]] => [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] => 2
[.,[.,[[.,[.,.]],[.,.]]]] => [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] => 2
[.,[.,[[.,[.,[.,.]]],.]]] => [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] => 2
[.,[.,[[[.,.],[.,.]],.]]] => [1,1,1,0,1,1,0,0,1,0,0,0] => 2
[.,[.,[[[.,[.,.]],.],.]]] => [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] => 3
[.,[[.,.],[.,[.,[.,.]]]]] => [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] => 2
[.,[[.,.],[[.,.],[.,.]]]] => [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] => 1
[.,[[.,[.,.]],[[.,.],.]]] => [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] => 1
[.,[[.,[[.,.],.]],[.,.]]] => [1,1,1,0,1,0,0,1,1,0,0,0] => 2
[.,[[[.,.],[.,.]],[.,.]]] => [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] => 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] => 1
[.,[[.,[.,[[.,.],.]]],.]] => [1,1,1,1,0,1,0,0,0,1,0,0] => 2
[.,[[.,[[.,.],[.,.]]],.]] => [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] => 2
[.,[[.,[[[.,.],.],.]],.]] => [1,1,1,0,1,0,1,0,0,1,0,0] => 2
[.,[[[.,.],[.,[.,.]]],.]] => [1,1,0,1,1,1,0,0,0,1,0,0] => 2
[.,[[[.,.],[[.,.],.]],.]] => [1,1,0,1,1,0,1,0,0,1,0,0] => 3
[.,[[[.,[.,.]],[.,.]],.]] => [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] => 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 simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path.
Also the number of simple modules that are isolated vertices in the sense of 4.5. (4) in the reference.
Also the number of simple modules that are isolated vertices in the sense of 4.5. (4) in the reference.
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!