Identifier
-
Mp00231:
Integer compositions
—bounce path⟶
Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St001035: Dyck paths ⟶ ℤ
Values
[1,1] => [1,0,1,0] => [1,1,0,0] => 0
[2] => [1,1,0,0] => [1,0,1,0] => 0
[1,1,1] => [1,0,1,0,1,0] => [1,1,0,1,0,0] => 0
[1,2] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 1
[2,1] => [1,1,0,0,1,0] => [1,0,1,1,0,0] => 1
[3] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => 0
[1,1,1,1] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => 0
[1,1,2] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,0,1,0] => 1
[1,2,1] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 2
[1,3] => [1,0,1,1,1,0,0,0] => [1,1,0,0,1,0,1,0] => 1
[2,1,1] => [1,1,0,0,1,0,1,0] => [1,0,1,1,0,1,0,0] => 1
[2,2] => [1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => 2
[3,1] => [1,1,1,0,0,0,1,0] => [1,0,1,0,1,1,0,0] => 1
[4] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => 0
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => 0
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => 1
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0] => 2
[1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,0,1,0,1,0] => 1
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,0,1,0,0] => 2
[1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => 3
[1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => 2
[1,4] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => 1
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,0,1,0,1,0,0] => 1
[2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,0,1,0,0,1,0] => 2
[2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => 3
[2,3] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => 2
[3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [1,0,1,0,1,1,0,1,0,0] => 1
[3,2] => [1,1,1,0,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => 2
[4,1] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0] => 1
[5] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 0
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 0
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0,1,0] => 1
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,0,1,1,0,0] => 2
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0,1,0,1,0] => 1
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,0,1,1,0,1,0,0] => 2
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,0,0,1,1,0,0,1,0] => 3
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,0,1,0,1,1,0,0] => 2
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,0,1,0,1,0,1,0] => 1
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,1,0,1,0,1,0,0] => 2
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,1,0,1,0,0,1,0] => 3
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => 4
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => 3
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,0,0,1,0,1,1,0,1,0,0] => 2
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => 3
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,0,0,1,0,1,0,1,1,0,0] => 2
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => 1
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0] => [1,0,1,1,0,1,0,1,0,1,0,0] => 1
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => [1,0,1,1,0,1,0,1,0,0,1,0] => 2
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => [1,0,1,1,0,1,0,0,1,1,0,0] => 3
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => [1,0,1,1,0,1,0,0,1,0,1,0] => 2
[2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,1,0,1,0,0] => 3
[2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => 4
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => [1,0,1,1,0,0,1,0,1,1,0,0] => 3
[2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => 2
[3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => [1,0,1,0,1,1,0,1,0,1,0,0] => 1
[3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => [1,0,1,0,1,1,0,1,0,0,1,0] => 2
[3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => 3
[3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => 2
[4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => [1,0,1,0,1,0,1,1,0,1,0,0] => 1
[4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => 2
[5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => 1
[6] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 0
[1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,1,0,0] => 0
[1,1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,1,0,0,1,0] => 1
[1,1,1,1,2,1] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,1,0,0,1,1,0,0] => 2
[1,1,1,1,3] => [1,0,1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,1,0,0,1,0,1,0] => 1
[1,1,1,2,1,1] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,1,0,0,1,1,0,1,0,0] => 2
[1,1,1,2,2] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,0,1,0,0,1,1,0,0,1,0] => 3
[1,1,1,3,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,0,0,1,0,1,1,0,0] => 2
[1,1,1,4] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,0,1,0,1,0,1,0] => 1
[1,1,2,1,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,1,0,0,1,1,0,1,0,1,0,0] => 2
[1,1,2,1,2] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,1,0,0,1,1,0,1,0,0,1,0] => 3
[1,1,2,2,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0,1,1,0,0] => 4
[1,1,2,3] => [1,0,1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,1,0,0,1,1,0,0,1,0,1,0] => 3
[1,1,3,1,1] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,0,1,0,0,1,0,1,1,0,1,0,0] => 2
[1,1,3,2] => [1,0,1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,0,0,1,0,1,1,0,0,1,0] => 3
[1,1,4,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,0,1,0,0,1,0,1,0,1,1,0,0] => 2
[1,1,5] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,0,1,0,0,1,0,1,0,1,0,1,0] => 1
[1,2,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0] => [1,1,0,0,1,1,0,1,0,1,0,1,0,0] => 2
[1,2,1,1,2] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0] => [1,1,0,0,1,1,0,1,0,1,0,0,1,0] => 3
[1,2,1,2,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,1,0,0,1,1,0,0] => 4
[1,2,1,3] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0] => [1,1,0,0,1,1,0,1,0,0,1,0,1,0] => 3
[1,2,2,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,0,0,1,1,0,1,0,0] => 4
[1,2,2,2] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0] => 5
[1,2,3,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0,1,1,0,0] => 4
[1,2,4] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0] => 3
[1,3,1,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0] => [1,1,0,0,1,0,1,1,0,1,0,1,0,0] => 2
[1,3,1,2] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,1,0,0,1,0] => 3
[1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0] => 4
[1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0] => 3
[1,4,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0] => [1,1,0,0,1,0,1,0,1,1,0,1,0,0] => 2
[1,4,2] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0] => 3
[1,5,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0] => 2
[1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0] => 1
[2,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,1,0,1,0,1,0,1,0,1,0,0] => 1
[2,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,1,0,1,0,1,0,1,0,0,1,0] => 2
[2,1,1,2,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0] => [1,0,1,1,0,1,0,1,0,0,1,1,0,0] => 3
[2,1,1,3] => [1,1,0,0,1,0,1,0,1,1,1,0,0,0] => [1,0,1,1,0,1,0,1,0,0,1,0,1,0] => 2
[2,1,2,1,1] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0] => [1,0,1,1,0,1,0,0,1,1,0,1,0,0] => 3
[2,1,2,2] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,1,0,0,1,1,0,0,1,0] => 4
[2,1,3,1] => [1,1,0,0,1,0,1,1,1,0,0,0,1,0] => [1,0,1,1,0,1,0,0,1,0,1,1,0,0] => 3
>>> Load all 231 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
Description
The convexity degree of the parallelogram polyomino associated with the Dyck path.
A parallelogram polyomino is $k$-convex if $k$ is the maximal number of turns an axis-parallel path must take to connect two cells of the polyomino.
For example, any rotation of a Ferrers shape has convexity degree at most one.
The (bivariate) generating function is given in Theorem 2 of [1].
A parallelogram polyomino is $k$-convex if $k$ is the maximal number of turns an axis-parallel path must take to connect two cells of the polyomino.
For example, any rotation of a Ferrers shape has convexity degree at most one.
The (bivariate) generating function is given in Theorem 2 of [1].
Map
Delest-Viennot
Description
Return the Dyck path corresponding to the parallelogram polyomino obtained by applying Delest-Viennot's bijection.
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 $(\gamma^{(-1)}\circ\beta)(D)$.
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 $(\gamma^{(-1)}\circ\beta)(D)$.
Map
bounce path
Description
The bounce path determined by an integer composition.
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!