- FindStat

Identifier

Mp00056: Parking functions —to Dyck path⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St000025: Dyck paths ⟶ ℤ (values match St000439The position of the first down step of a Dyck path.)

Values

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

>>> Load all 18248 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 + 2\ q^{2}$

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

$F_{4} = 27\ q + 38\ q^{2} + 36\ q^{3} + 24\ q^{4}$

$F_{5} = 256\ q + 350\ q^{2} + 330\ q^{3} + 240\ q^{4} + 120\ q^{5}$

$F_{6} = 3125\ q + 4202\ q^{2} + 3960\ q^{3} + 3000\ q^{4} + 1800\ q^{5} + 720\ q^{6}$

Description

The number of initial rises of a Dyck path.
In other words, this is the height of the first peak of

$D$ .

Map

to Dyck path

Description

Sends a parking function to its support Dyck word.

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