- FindStat

Identifier

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

Values

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

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

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

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

[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

$F_{2} = 2$

$F_{3} = 5$

$F_{4} = 14$

$F_{5} = 42$

$F_{6} = 132$

$F_{7} = 429$

Description

The number of boxes weakly below the path and above the diagonal that lie below at least two peaks.
For example, the path

$111011010000$ has three peaks in positions

$03, 15, 26$ . The boxes below

$03$ are

$01,02,\textbf{12}$ , the boxes below

$15$ are

$\textbf{12},13,14,\textbf{23},\textbf{24},\textbf{34}$ , and the boxes below

$26$ are

$\textbf{23},\textbf{24},25,\textbf{34},35,45$ .
We thus obtain the four boxes in positions

$12,23,24,34$ that are below at least two peaks.

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.