Identifier
-
Mp00178:
Binary words
—to composition⟶
Integer compositions
Mp00314: Integer compositions —Foata bijection⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000386: Dyck paths ⟶ ℤ
Values
0 => [2] => [2] => [1,1,0,0] => 0
1 => [1,1] => [1,1] => [1,0,1,0] => 0
00 => [3] => [3] => [1,1,1,0,0,0] => 0
01 => [2,1] => [2,1] => [1,1,0,0,1,0] => 1
10 => [1,2] => [1,2] => [1,0,1,1,0,0] => 0
11 => [1,1,1] => [1,1,1] => [1,0,1,0,1,0] => 0
000 => [4] => [4] => [1,1,1,1,0,0,0,0] => 0
001 => [3,1] => [3,1] => [1,1,1,0,0,0,1,0] => 1
010 => [2,2] => [2,2] => [1,1,0,0,1,1,0,0] => 1
011 => [2,1,1] => [1,2,1] => [1,0,1,1,0,0,1,0] => 1
100 => [1,3] => [1,3] => [1,0,1,1,1,0,0,0] => 0
101 => [1,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0] => 1
110 => [1,1,2] => [1,1,2] => [1,0,1,0,1,1,0,0] => 0
111 => [1,1,1,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0] => 0
0000 => [5] => [5] => [1,1,1,1,1,0,0,0,0,0] => 0
0001 => [4,1] => [4,1] => [1,1,1,1,0,0,0,0,1,0] => 1
0010 => [3,2] => [3,2] => [1,1,1,0,0,0,1,1,0,0] => 1
0011 => [3,1,1] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0] => 1
0100 => [2,3] => [2,3] => [1,1,0,0,1,1,1,0,0,0] => 1
0101 => [2,2,1] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0] => 2
0110 => [2,1,2] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0] => 1
0111 => [2,1,1,1] => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => 1
1000 => [1,4] => [1,4] => [1,0,1,1,1,1,0,0,0,0] => 0
1001 => [1,3,1] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0] => 1
1010 => [1,2,2] => [1,2,2] => [1,0,1,1,0,0,1,1,0,0] => 1
1011 => [1,2,1,1] => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => 1
1100 => [1,1,3] => [1,1,3] => [1,0,1,0,1,1,1,0,0,0] => 0
1101 => [1,1,2,1] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => 1
1110 => [1,1,1,2] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => 0
1111 => [1,1,1,1,1] => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => 0
00000 => [6] => [6] => [1,1,1,1,1,1,0,0,0,0,0,0] => 0
00001 => [5,1] => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => 1
00010 => [4,2] => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => 1
00011 => [4,1,1] => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => 1
00100 => [3,3] => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => 1
00101 => [3,2,1] => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => 2
00110 => [3,1,2] => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => 1
00111 => [3,1,1,1] => [1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => 1
01000 => [2,4] => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => 1
01001 => [2,3,1] => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => 2
01010 => [2,2,2] => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => 2
01011 => [2,2,1,1] => [1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => 2
01100 => [2,1,3] => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => 1
01101 => [2,1,2,1] => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => 2
01110 => [2,1,1,2] => [1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => 1
01111 => [2,1,1,1,1] => [1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => 1
10000 => [1,5] => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => 0
10001 => [1,4,1] => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => 1
10010 => [1,3,2] => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => 1
10011 => [1,3,1,1] => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => 1
10100 => [1,2,3] => [1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => 1
10101 => [1,2,2,1] => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => 2
10110 => [1,2,1,2] => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => 1
10111 => [1,2,1,1,1] => [1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => 1
11000 => [1,1,4] => [1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => 0
11001 => [1,1,3,1] => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => 1
11010 => [1,1,2,2] => [1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => 1
11011 => [1,1,2,1,1] => [1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => 1
11100 => [1,1,1,3] => [1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => 0
11101 => [1,1,1,2,1] => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0] => 1
11110 => [1,1,1,1,2] => [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,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => 0
000000 => [7] => [7] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => 0
000001 => [6,1] => [6,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => 1
000010 => [5,2] => [5,2] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0] => 1
000011 => [5,1,1] => [1,5,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => 1
000100 => [4,3] => [4,3] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0] => 1
000101 => [4,2,1] => [4,2,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0] => 2
000110 => [4,1,2] => [1,4,2] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0] => 1
000111 => [4,1,1,1] => [1,1,4,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0] => 1
001000 => [3,4] => [3,4] => [1,1,1,0,0,0,1,1,1,1,0,0,0,0] => 1
001001 => [3,3,1] => [3,3,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0] => 2
001010 => [3,2,2] => [2,3,2] => [1,1,0,0,1,1,1,0,0,0,1,1,0,0] => 2
001011 => [3,2,1,1] => [1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0] => 2
001100 => [3,1,3] => [3,1,3] => [1,1,1,0,0,0,1,0,1,1,1,0,0,0] => 1
001101 => [3,1,2,1] => [3,1,2,1] => [1,1,1,0,0,0,1,0,1,1,0,0,1,0] => 2
001110 => [3,1,1,2] => [1,1,3,2] => [1,0,1,0,1,1,1,0,0,0,1,1,0,0] => 1
001111 => [3,1,1,1,1] => [1,1,1,3,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0] => 1
010000 => [2,5] => [2,5] => [1,1,0,0,1,1,1,1,1,0,0,0,0,0] => 1
010001 => [2,4,1] => [2,4,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0] => 2
010010 => [2,3,2] => [3,2,2] => [1,1,1,0,0,0,1,1,0,0,1,1,0,0] => 2
010011 => [2,3,1,1] => [1,2,3,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0] => 2
010100 => [2,2,3] => [2,2,3] => [1,1,0,0,1,1,0,0,1,1,1,0,0,0] => 2
010101 => [2,2,2,1] => [2,2,2,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0] => 3
010110 => [2,2,1,2] => [2,2,1,2] => [1,1,0,0,1,1,0,0,1,0,1,1,0,0] => 2
010111 => [2,2,1,1,1] => [1,1,2,2,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0] => 2
011000 => [2,1,4] => [2,1,4] => [1,1,0,0,1,0,1,1,1,1,0,0,0,0] => 1
011001 => [2,1,3,1] => [2,3,1,1] => [1,1,0,0,1,1,1,0,0,0,1,0,1,0] => 2
011010 => [2,1,2,2] => [2,1,2,2] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0] => 2
011011 => [2,1,2,1,1] => [1,2,2,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0] => 2
011100 => [2,1,1,3] => [1,2,1,3] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0] => 1
011101 => [2,1,1,2,1] => [2,1,2,1,1] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0] => 2
011110 => [2,1,1,1,2] => [1,1,2,1,2] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0] => 1
011111 => [2,1,1,1,1,1] => [1,1,1,1,2,1] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0] => 1
100000 => [1,6] => [1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => 0
100001 => [1,5,1] => [5,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0] => 1
100010 => [1,4,2] => [4,1,2] => [1,1,1,1,0,0,0,0,1,0,1,1,0,0] => 1
100011 => [1,4,1,1] => [1,4,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0] => 1
100100 => [1,3,3] => [1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0] => 1
100101 => [1,3,2,1] => [3,2,1,1] => [1,1,1,0,0,0,1,1,0,0,1,0,1,0] => 2
100110 => [1,3,1,2] => [1,3,1,2] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0] => 1
>>> Load all 264 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 factors DDU in a Dyck path.
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
Foata bijection
Description
The Foata bijection for compositions.
The Foata bijection $\phi$ is a bijection on the set of words whose letters are positive integers. It can be defined by induction on the size of the word:
Given a word $w_1 w_2 ... w_n$, compute the image inductively by starting with $\phi(w_1) = w_1$.
At the $i$-th step, if $\phi(w_1 w_2 ... w_i) = v_1 v_2 ... v_i$, define $\phi(w_1 w_2 ... w_i w_{i+1})$ by placing $w_{i+1}$ on the end of the word $v_1 v_2 ... v_i$ and breaking the word up into blocks as follows.
To compute $\phi([1,4,2,5,3])$, the sequence of words is
This bijection sends the major index St000769The major index of a composition regarded as a word. to the number of inversions St000766The number of inversions of an integer composition..
The Foata bijection $\phi$ is a bijection on the set of words whose letters are positive integers. It can be defined by induction on the size of the word:
Given a word $w_1 w_2 ... w_n$, compute the image inductively by starting with $\phi(w_1) = w_1$.
At the $i$-th step, if $\phi(w_1 w_2 ... w_i) = v_1 v_2 ... v_i$, define $\phi(w_1 w_2 ... w_i w_{i+1})$ by placing $w_{i+1}$ on the end of the word $v_1 v_2 ... v_i$ and breaking the word up into blocks as follows.
- If $w_{i+1} \geq v_i$, place a vertical line to the right of each $v_k$ for which $w_{i+1} \geq v_k$.
- If $w_{i+1} < v_i$, place a vertical line to the right of each $v_k$ for which $w_{i+1} < v_k$.
To compute $\phi([1,4,2,5,3])$, the sequence of words is
- $1$
- $|1|4 \to 14$
- $|14|2 \to 412$
- $|4|1|2|5 \to 4125$
- $|4|125|3 \to 45123.$
This bijection sends the major index St000769The major index of a composition regarded as a word. to the number of inversions St000766The number of inversions of 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!