- FindStat

Identifier

Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St001234: Dyck paths ⟶ ℤ (values match St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension.)

Values

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

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} = 1$

$F_{2} = 2$

$F_{3} = 5$

$F_{4} = 13 + q$

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

Description

The number of indecomposable three dimensional modules with projective dimension one.
It return zero when there are no such modules.

Map

decomposition reverse

Description

This map is recursively defined as follows.
The unique empty path of semilength

$0$ is sent to itself.
Let

$D$ be a Dyck path of semilength

$n > 0$ and decompose it into

$1 D_1 0 D_2$ with Dyck paths

$D_1, D_2$ of respective semilengths

$n_1$ and

$n_2$ such that

$n_1$ is minimal. One then has

$n_1+n_2 = n-1$ .
Now let

$\tilde D_1$ and

$\tilde D_2$ be the recursively defined respective images of

$D_1$ and

$D_2$ under this map. The image of

$D$ is then defined as

$1 \tilde D_2 0 \tilde D_1$ .

Map

prime Dyck path

Description

Return the Dyck path obtained by adding an initial up and a final down step.

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:

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