- FindStat

Identifier

Mp00099: Dyck paths —bounce path⟶ Dyck paths
St001107: Dyck paths ⟶ ℤ

Values

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

>>> Load all 1760 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

Description

The number of times one can erase the first up and the last down step in a Dyck path and still remain a Dyck path.
In other words, this is the lowest height of a valley of a Dyck path, or its semilength in case of the unique path without valleys.

Map

bounce path

Description

Sends a Dyck path $D$ of length $2n$ to its bounce path.
This path is formed by starting at the endpoint $(n,n)$ of $D$ and travelling west until encountering the first vertical step of $D$, then south until hitting the diagonal, then west again to hit $D$, etc. until the point $(0,0)$ is reached.
This map is the first part of the zeta map Mp00030zeta map.