- FindStat

Identifier

Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00327: Dyck paths —inverse Kreweras complement⟶ Dyck paths
St000005: Dyck paths ⟶ ℤ

Values

[1,0] => [1,1,0,0] => [1,0,1,0] => 1
[1,0,1,0] => [1,1,0,1,0,0] => [1,1,0,0,1,0] => 2
[1,1,0,0] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => 3
[1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [1,1,1,0,0,0,1,0] => 3
[1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [1,1,0,0,1,0,1,0] => 5
[1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,0] => 4
[1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [1,0,1,1,0,0,1,0] => 4
[1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => 6
[1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => 4
[1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,0,0,1,0,1,0] => 7
[1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => 5
[1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0] => 6
[1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => 9
[1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => 5
[1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [1,1,0,1,0,0,1,0,1,0] => 8
[1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => 6
[1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0,1,0] => 5
[1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => 8
[1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => 6
[1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,0,1,1,0,1,0,0,1,0] => 7
[1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => 7
[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] => 10
[1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => 5
[1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [1,1,1,1,0,0,0,0,1,0,1,0] => 9
[1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,0,0,1,0] => 6
[1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => 8
[1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [1,1,1,0,0,0,1,0,1,0,1,0] => 12
[1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [1,1,1,0,1,1,0,0,0,0,1,0] => 6
[1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => [1,1,1,0,1,0,0,0,1,0,1,0] => 10
[1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0,1,0] => 7
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => 7
[1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => 11
[1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0,1,0] => 7
[1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => [1,1,0,0,1,1,0,1,0,0,1,0] => 10
[1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => 10
[1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => 14
[1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,0,0,1,0] => 6
[1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => [1,1,0,1,1,0,0,0,1,0,1,0] => 10
[1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0,1,0] => 7
[1,1,0,0,1,1,0,1,0,0] => [1,1,1,0,0,1,1,0,1,0,0,0] => [1,1,0,1,0,0,1,1,0,0,1,0] => 9
[1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => [1,1,0,1,0,0,1,0,1,0,1,0] => 13
[1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => [1,1,1,0,0,1,1,0,0,0,1,0] => 7
[1,1,0,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => [1,1,1,0,0,1,0,0,1,0,1,0] => 11
[1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => [1,1,1,1,0,0,0,1,0,0,1,0] => 8
[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,1,1,1,0,0,0,0,1,0] => 6
[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,1,1,0,0,0,1,0,1,0] => 10
[1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => [1,1,1,0,0,1,0,1,0,0,1,0] => 8
[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,1,1,0,1,0,0,0,1,0] => 8
[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,1,0,0,1,1,0,0,1,0] => 9
[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,1,0,0,1,0,1,0,1,0] => 13
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [1,1,0,1,0,1,1,0,0,0,1,0] => 7
[1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => [1,1,0,1,0,1,0,0,1,0,1,0] => 11
[1,1,1,0,0,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => [1,1,1,0,1,0,0,1,0,0,1,0] => 8
[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,1,0,1,1,0,0,0,1,0] => 8
[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,1,0,1,0,0,1,0,1,0] => 12
[1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,0,1,0] => 9
[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,1,1,0,0,1,0,0,1,0] => 9
[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,1,1,0,0,0,1,0] => 8
[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,1,0,0,1,0,1,0] => 12
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,1,0,1,0,1,0,1,0,0,1,0] => 9
[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,1,0,1,0,1,0,0,1,0] => 9
[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,1,0,1,0,0,1,0] => 11
[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,1,0,0,1,0] => 11
[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] => 15
[] => [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} = q$

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

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

$F_{4} = q^{4} + 3\ q^{5} + 3\ q^{6} + 3\ q^{7} + 2\ q^{8} + q^{9} + q^{10}$

$F_{5} = q^{5} + 4\ q^{6} + 6\ q^{7} + 7\ q^{8} + 7\ q^{9} + 5\ q^{10} + 5\ q^{11} + 3\ q^{12} + 2\ q^{13} + q^{14} + q^{15}$

Description

The bounce statistic of a Dyck path.
The bounce path

$D'$ of a Dyck path

$D$ is the Dyck path obtained from

$D$ by starting at the end point

$(2n,0)$ , traveling north-west until hitting

$D$ , then bouncing back south-west to the

$x$ -axis, and repeating this procedure until finally reaching the point

$(0,0)$ .
The points where

$D'$ touches the

$x$ -axis are called bounce points, and a bounce path is uniquely determined by its bounce points.
This statistic is given by the sum of all

$i$ for which the bounce path

$D'$ of

$D$ touches the

$x$ -axis at

$(2i,0)$ .
In particular, the bounce statistics of

$D$ and

$D'$ coincide.

Map

prime Dyck path

Description

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

Map

inverse Kreweras complement

Description

Return the inverse of the Kreweras complement of a Dyck path, regarded as a noncrossing set partition.
To identify Dyck paths and noncrossing set partitions, this maps uses the following classical bijection. The number of down steps after the

$i$ -th up step of the Dyck path is the size of the block of the set partition whose maximal element is

$i$ . If

$i$ is not a maximal element of a block, the

$(i+1)$ -st step is also an up step.