Identifier
-
Mp00178:
Binary words
—to composition⟶
Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000052: Dyck paths ⟶ ℤ
Values
0 => [2] => [1,1,0,0] => 0
1 => [1,1] => [1,0,1,0] => 0
00 => [3] => [1,1,1,0,0,0] => 0
01 => [2,1] => [1,1,0,0,1,0] => 0
10 => [1,2] => [1,0,1,1,0,0] => 0
11 => [1,1,1] => [1,0,1,0,1,0] => 0
000 => [4] => [1,1,1,1,0,0,0,0] => 0
001 => [3,1] => [1,1,1,0,0,0,1,0] => 0
010 => [2,2] => [1,1,0,0,1,1,0,0] => 0
011 => [2,1,1] => [1,1,0,0,1,0,1,0] => 0
100 => [1,3] => [1,0,1,1,1,0,0,0] => 0
101 => [1,2,1] => [1,0,1,1,0,0,1,0] => 0
110 => [1,1,2] => [1,0,1,0,1,1,0,0] => 0
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0] => 0
0000 => [5] => [1,1,1,1,1,0,0,0,0,0] => 0
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0] => 0
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0] => 0
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0] => 0
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0] => 0
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0] => 0
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0] => 0
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => 0
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0] => 0
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0] => 0
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0] => 0
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => 0
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0] => 0
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => 0
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => 0
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => 0
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0] => 0
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => 0
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => 0
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => 0
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => 0
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => 0
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => 0
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => 0
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => 0
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => 0
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => 0
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => 0
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => 0
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => 0
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => 0
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0] => 0
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => 0
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => 0
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => 0
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => 0
10100 => [1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => 0
10101 => [1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => 0
10110 => [1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => 0
10111 => [1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => 0
11000 => [1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => 0
11001 => [1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => 0
11010 => [1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => 0
11011 => [1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => 0
11100 => [1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => 0
11101 => [1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => 0
11110 => [1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => 0
11111 => [1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => 0
000000 => [7] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => 0
000001 => [6,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => 0
000010 => [5,2] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0] => 0
000011 => [5,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0] => 0
000100 => [4,3] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0] => 0
000101 => [4,2,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0] => 0
000110 => [4,1,2] => [1,1,1,1,0,0,0,0,1,0,1,1,0,0] => 0
000111 => [4,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0] => 0
001000 => [3,4] => [1,1,1,0,0,0,1,1,1,1,0,0,0,0] => 0
001001 => [3,3,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0] => 0
001010 => [3,2,2] => [1,1,1,0,0,0,1,1,0,0,1,1,0,0] => 0
001011 => [3,2,1,1] => [1,1,1,0,0,0,1,1,0,0,1,0,1,0] => 0
001100 => [3,1,3] => [1,1,1,0,0,0,1,0,1,1,1,0,0,0] => 0
001101 => [3,1,2,1] => [1,1,1,0,0,0,1,0,1,1,0,0,1,0] => 0
001110 => [3,1,1,2] => [1,1,1,0,0,0,1,0,1,0,1,1,0,0] => 0
001111 => [3,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0] => 0
010000 => [2,5] => [1,1,0,0,1,1,1,1,1,0,0,0,0,0] => 0
010001 => [2,4,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0] => 0
010010 => [2,3,2] => [1,1,0,0,1,1,1,0,0,0,1,1,0,0] => 0
010011 => [2,3,1,1] => [1,1,0,0,1,1,1,0,0,0,1,0,1,0] => 0
010100 => [2,2,3] => [1,1,0,0,1,1,0,0,1,1,1,0,0,0] => 0
010101 => [2,2,2,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0] => 0
010110 => [2,2,1,2] => [1,1,0,0,1,1,0,0,1,0,1,1,0,0] => 0
010111 => [2,2,1,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0] => 0
011000 => [2,1,4] => [1,1,0,0,1,0,1,1,1,1,0,0,0,0] => 0
011001 => [2,1,3,1] => [1,1,0,0,1,0,1,1,1,0,0,0,1,0] => 0
011010 => [2,1,2,2] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0] => 0
011011 => [2,1,2,1,1] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0] => 0
011100 => [2,1,1,3] => [1,1,0,0,1,0,1,0,1,1,1,0,0,0] => 0
011101 => [2,1,1,2,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0] => 0
011110 => [2,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0] => 0
011111 => [2,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0] => 0
100000 => [1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => 0
100001 => [1,5,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => 0
100010 => [1,4,2] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0] => 0
100011 => [1,4,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0] => 0
100100 => [1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0] => 0
100101 => [1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0] => 0
100110 => [1,3,1,2] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0] => 0
>>> Load all 199 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 number of valleys of a Dyck path not on the x-axis.
That is, the number of valleys of nonminimal height. This corresponds to the number of -1's in an inclusion of Dyck paths into alternating sign matrices.
That is, the number of valleys of nonminimal height. This corresponds to the number of -1's in an inclusion of Dyck paths into alternating sign matrices.
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.
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!