Identifier
-
Mp00178:
Binary words
—to composition⟶
Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St000012: Dyck paths ⟶ ℤ (values match St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2.)
Values
0 => [2] => [1,1,0,0] => [1,0,1,0] => 0
1 => [1,1] => [1,0,1,0] => [1,1,0,0] => 1
00 => [3] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => 0
01 => [2,1] => [1,1,0,0,1,0] => [1,0,1,1,0,0] => 1
10 => [1,2] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 1
11 => [1,1,1] => [1,0,1,0,1,0] => [1,1,0,1,0,0] => 2
000 => [4] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => 0
001 => [3,1] => [1,1,1,0,0,0,1,0] => [1,0,1,0,1,1,0,0] => 1
010 => [2,2] => [1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => 1
011 => [2,1,1] => [1,1,0,0,1,0,1,0] => [1,0,1,1,0,1,0,0] => 2
100 => [1,3] => [1,0,1,1,1,0,0,0] => [1,1,0,0,1,0,1,0] => 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 2
110 => [1,1,2] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,0,1,0] => 2
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => 3
0000 => [5] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 0
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0] => 1
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => 1
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [1,0,1,0,1,1,0,1,0,0] => 2
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => 1
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => 2
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,0,1,0,0,1,0] => 2
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,0,1,0,1,0,0] => 3
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => 2
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => 2
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,0,1,0,0] => 3
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,0,1,0,1,0] => 2
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0] => 3
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => 3
1111 => [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] => 4
00000 => [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
00001 => [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
00010 => [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] => 1
00011 => [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] => 2
00100 => [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] => 1
00101 => [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] => 2
00110 => [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
00111 => [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] => 3
01000 => [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] => 1
01001 => [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] => 2
01010 => [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] => 2
01011 => [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
01100 => [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
01101 => [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
01110 => [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] => 3
01111 => [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] => 4
10000 => [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
10001 => [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
10010 => [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] => 2
10011 => [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] => 3
10100 => [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] => 2
10101 => [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] => 3
10110 => [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
10111 => [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] => 4
11000 => [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] => 2
11001 => [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] => 3
11010 => [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
11011 => [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] => 4
11100 => [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] => 3
11101 => [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] => 4
11110 => [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] => 4
11111 => [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] => 5
000000 => [7] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => 0
000001 => [6,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => 1
000010 => [5,2] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0] => 1
000011 => [5,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,1,0,1,0,0] => 2
000100 => [4,3] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0] => 1
000101 => [4,2,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0] => 2
000110 => [4,1,2] => [1,1,1,1,0,0,0,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,1,0,1,0,0,1,0] => 2
000111 => [4,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,1,0,1,0,1,0,0] => 3
001000 => [3,4] => [1,1,1,0,0,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0] => 1
001001 => [3,3,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0] => 2
001010 => [3,2,2] => [1,1,1,0,0,0,1,1,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0] => 2
001011 => [3,2,1,1] => [1,1,1,0,0,0,1,1,0,0,1,0,1,0] => [1,0,1,0,1,1,0,0,1,1,0,1,0,0] => 3
001100 => [3,1,3] => [1,1,1,0,0,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,0,1,0,0,1,0,1,0] => 2
001101 => [3,1,2,1] => [1,1,1,0,0,0,1,0,1,1,0,0,1,0] => [1,0,1,0,1,1,0,1,0,0,1,1,0,0] => 3
001110 => [3,1,1,2] => [1,1,1,0,0,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,1,0,1,0,1,0,0,1,0] => 3
001111 => [3,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,1,0,1,0,1,0,1,0,0] => 4
010000 => [2,5] => [1,1,0,0,1,1,1,1,1,0,0,0,0,0] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0] => 1
010001 => [2,4,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0] => 2
010010 => [2,3,2] => [1,1,0,0,1,1,1,0,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0] => 2
010011 => [2,3,1,1] => [1,1,0,0,1,1,1,0,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,1,0,1,0,0] => 3
010100 => [2,2,3] => [1,1,0,0,1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0] => 2
010101 => [2,2,2,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => 3
010110 => [2,2,1,2] => [1,1,0,0,1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,1,0,0,1,0] => 3
010111 => [2,2,1,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,0,0,1,1,0,1,0,1,0,0] => 4
011000 => [2,1,4] => [1,1,0,0,1,0,1,1,1,1,0,0,0,0] => [1,0,1,1,0,1,0,0,1,0,1,0,1,0] => 2
011001 => [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
011010 => [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] => 3
011011 => [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] => 4
011100 => [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] => 3
011101 => [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] => 4
011110 => [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] => 4
011111 => [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] => 5
100000 => [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
100001 => [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
100010 => [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] => 2
100011 => [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] => 3
100100 => [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] => 2
100101 => [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] => 3
100110 => [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
>>> 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 area of a Dyck path.
This is the number of complete squares in the integer lattice which are below the path and above the x-axis. The 'half-squares' directly above the axis do not contribute to this statistic.
1. Dyck paths are bijection with area sequences $(a_1,\ldots,a_n)$ such that $a_1 = 0, a_{k+1} \leq a_k + 1$.
2. The generating function $\mathbf{D}_n(q) = \sum_{D \in \mathfrak{D}_n} q^{\operatorname{area}(D)}$ satisfy the recurrence $$\mathbf{D}_{n+1}(q) = \sum q^k \mathbf{D}_k(q) \mathbf{D}_{n-k}(q).$$
3. The area is equidistributed with St000005The bounce statistic of a Dyck path. and St000006The dinv of a Dyck path.. Pairs of these statistics play an important role in the theory of $q,t$-Catalan numbers.
This is the number of complete squares in the integer lattice which are below the path and above the x-axis. The 'half-squares' directly above the axis do not contribute to this statistic.
1. Dyck paths are bijection with area sequences $(a_1,\ldots,a_n)$ such that $a_1 = 0, a_{k+1} \leq a_k + 1$.
2. The generating function $\mathbf{D}_n(q) = \sum_{D \in \mathfrak{D}_n} q^{\operatorname{area}(D)}$ satisfy the recurrence $$\mathbf{D}_{n+1}(q) = \sum q^k \mathbf{D}_k(q) \mathbf{D}_{n-k}(q).$$
3. The area is equidistributed with St000005The bounce statistic of a Dyck path. and St000006The dinv of a Dyck path.. Pairs of these statistics play an important role in the theory of $q,t$-Catalan numbers.
Map
bounce path
Description
The bounce path determined by an integer composition.
Map
to composition
Description
The composition corresponding to a binary word.
Prepending $1$ to a binary word $w$, the $i$-th part of the composition equals $1$ plus the number of zeros after the $i$-th $1$ in $w$.
This map is not surjective, since the empty composition does not have a preimage.
Prepending $1$ to a binary word $w$, the $i$-th part of the composition equals $1$ plus the number of zeros after the $i$-th $1$ in $w$.
This map is not surjective, since the empty composition does not have a preimage.
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)$.
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!