- FindStat

Identifier

Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St000013: Dyck paths ⟶ ℤ (values match St000442The maximal area to the right of an up step of a Dyck path.)

Values

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

>>> Load all 1598 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 height of a Dyck path.
The height of a Dyck path $D$ of semilength $n$ is defined as the maximal height of a peak of $D$. The height of $D$ at position $i$ is the number of up-steps minus the number of down-steps before position $i$.

Map

Delest-Viennot-inverse

Description

Return the Dyck path obtained by applying the inverse of Delest-Viennot's bijection to the corresponding parallelogram polyomino.
Let $D$ be a Dyck path of semilength $n$. The parallelogram polyomino $\gamma(D)$ is defined as follows: let $\tilde D = d_0 d_1 \dots d_{2n+1}$ be the Dyck path obtained by prepending an up step and appending a down step to $D$. Then, the upper path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with even indices, and the lower path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with odd indices.
The Delest-Viennot bijection $\beta$ returns the parallelogram polyomino, whose column heights are the heights of the peaks of the Dyck path, and the intersection heights between columns are the heights of the valleys of the Dyck path.
This map returns the Dyck path $(\beta^{(-1)}\circ\gamma)(D)$.