- FindStat

Identifier

Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St000024: Dyck paths ⟶ ℤ (values match St000443The number of long tunnels of a Dyck path., St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path., St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra., St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra.)

Values

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

$F_{2} = 1 + q$

$F_{3} = 1 + 3\ q + q^{2}$

$F_{4} = 1 + 6\ q + 6\ q^{2} + q^{3}$

$F_{5} = 1 + 10\ q + 20\ q^{2} + 10\ q^{3} + q^{4}$

$F_{6} = 1 + 15\ q + 50\ q^{2} + 50\ q^{3} + 15\ q^{4} + q^{5}$

$F_{7} = 1 + 21\ q + 105\ q^{2} + 175\ q^{3} + 105\ q^{4} + 21\ q^{5} + q^{6}$

Description

The number of double up and double down steps of a Dyck path.
In other words, this is the number of double rises (and, equivalently, the number of double falls) of a Dyck path.

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