Identifier
-
Mp00231:
Integer compositions
—bounce path⟶
Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00109: Permutations —descent word⟶ Binary words
St000529: Binary words ⟶ ℤ
Values
[1,1] => [1,0,1,0] => [1,2] => 0 => 1
[2] => [1,1,0,0] => [2,1] => 1 => 1
[1,1,1] => [1,0,1,0,1,0] => [1,2,3] => 00 => 1
[1,2] => [1,0,1,1,0,0] => [1,3,2] => 01 => 2
[2,1] => [1,1,0,0,1,0] => [2,1,3] => 10 => 2
[3] => [1,1,1,0,0,0] => [3,2,1] => 11 => 1
[1,1,1,1] => [1,0,1,0,1,0,1,0] => [1,2,3,4] => 000 => 1
[1,1,2] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => 001 => 3
[1,2,1] => [1,0,1,1,0,0,1,0] => [1,3,2,4] => 010 => 5
[1,3] => [1,0,1,1,1,0,0,0] => [1,4,3,2] => 011 => 3
[2,1,1] => [1,1,0,0,1,0,1,0] => [2,1,3,4] => 100 => 3
[2,2] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => 101 => 5
[3,1] => [1,1,1,0,0,0,1,0] => [3,2,1,4] => 110 => 3
[4] => [1,1,1,1,0,0,0,0] => [4,3,2,1] => 111 => 1
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => 0000 => 1
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => 0001 => 4
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => 0010 => 9
[1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [1,2,5,4,3] => 0011 => 6
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => 0100 => 9
[1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => 0101 => 16
[1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [1,4,3,2,5] => 0110 => 11
[1,4] => [1,0,1,1,1,1,0,0,0,0] => [1,5,4,3,2] => 0111 => 4
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => 1000 => 4
[2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => 1001 => 11
[2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => 1010 => 16
[2,3] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => 1011 => 9
[3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [3,2,1,4,5] => 1100 => 6
[3,2] => [1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => 1101 => 9
[4,1] => [1,1,1,1,0,0,0,0,1,0] => [4,3,2,1,5] => 1110 => 4
[5] => [1,1,1,1,1,0,0,0,0,0] => [5,4,3,2,1] => 1111 => 1
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6] => 00000 => 1
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,6,5] => 00001 => 5
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,5,4,6] => 00010 => 14
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,6,5,4] => 00011 => 10
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,4,3,5,6] => 00100 => 19
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => 00101 => 35
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,4,3,6] => 00110 => 26
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,5,4,3] => 00111 => 10
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,3,2,4,5,6] => 01000 => 14
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,3,2,4,6,5] => 01001 => 40
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4,6] => 01010 => 61
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,5,4] => 01011 => 35
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,4,3,2,5,6] => 01100 => 26
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,4,3,2,6,5] => 01101 => 40
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,5,4,3,2,6] => 01110 => 19
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,6,5,4,3,2] => 01111 => 5
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0] => [2,1,3,4,5,6] => 10000 => 5
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => [2,1,3,4,6,5] => 10001 => 19
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => [2,1,3,5,4,6] => 10010 => 40
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => [2,1,3,6,5,4] => 10011 => 26
[2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => [2,1,4,3,5,6] => 10100 => 35
[2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => [2,1,4,3,6,5] => 10101 => 61
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => [2,1,5,4,3,6] => 10110 => 40
[2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => [2,1,6,5,4,3] => 10111 => 14
[3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => [3,2,1,4,5,6] => 11000 => 10
[3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => [3,2,1,4,6,5] => 11001 => 26
[3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => [3,2,1,5,4,6] => 11010 => 35
[3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [3,2,1,6,5,4] => 11011 => 19
[4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => [4,3,2,1,5,6] => 11100 => 10
[4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => [4,3,2,1,6,5] => 11101 => 14
[5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => [5,4,3,2,1,6] => 11110 => 5
[6] => [1,1,1,1,1,1,0,0,0,0,0,0] => [6,5,4,3,2,1] => 11111 => 1
[1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6,7] => 000000 => 1
[1,1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,5,7,6] => 000001 => 6
[1,1,1,1,2,1] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,4,6,5,7] => 000010 => 20
[1,1,1,1,3] => [1,0,1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,4,7,6,5] => 000011 => 15
[1,1,1,2,1,1] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,3,5,4,6,7] => 000100 => 34
[1,1,1,2,2] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,3,5,4,7,6] => 000101 => 64
[1,1,1,3,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,3,6,5,4,7] => 000110 => 50
[1,1,1,4] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,3,7,6,5,4] => 000111 => 20
[1,1,2,1,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0] => [1,2,4,3,5,6,7] => 001000 => 34
[1,1,2,1,2] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0] => [1,2,4,3,5,7,6] => 001001 => 99
[1,1,2,2,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0] => [1,2,4,3,6,5,7] => 001010 => 155
[1,1,2,3] => [1,0,1,0,1,1,0,0,1,1,1,0,0,0] => [1,2,4,3,7,6,5] => 001011 => 90
[1,1,3,1,1] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0] => [1,2,5,4,3,6,7] => 001100 => 71
[1,1,3,2] => [1,0,1,0,1,1,1,0,0,0,1,1,0,0] => [1,2,5,4,3,7,6] => 001101 => 111
[1,1,4,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0] => [1,2,6,5,4,3,7] => 001110 => 55
[1,1,5] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0] => [1,2,7,6,5,4,3] => 001111 => 15
[1,2,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0] => [1,3,2,4,5,6,7] => 010000 => 20
[1,2,1,1,2] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0] => [1,3,2,4,5,7,6] => 010001 => 78
[1,2,1,2,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0] => [1,3,2,4,6,5,7] => 010010 => 169
[1,2,1,3] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0] => [1,3,2,4,7,6,5] => 010011 => 111
[1,2,2,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0] => [1,3,2,5,4,6,7] => 010100 => 155
[1,2,2,2] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4,7,6] => 010101 => 272
[1,2,3,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0] => [1,3,2,6,5,4,7] => 010110 => 181
[1,2,4] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0] => [1,3,2,7,6,5,4] => 010111 => 64
[1,3,1,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0] => [1,4,3,2,5,6,7] => 011000 => 50
[1,3,1,2] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0] => [1,4,3,2,5,7,6] => 011001 => 132
[1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0] => [1,4,3,2,6,5,7] => 011010 => 181
[1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0] => [1,4,3,2,7,6,5] => 011011 => 99
[1,4,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0] => [1,5,4,3,2,6,7] => 011100 => 55
[1,4,2] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0] => [1,5,4,3,2,7,6] => 011101 => 78
[1,5,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => [1,6,5,4,3,2,7] => 011110 => 29
[1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [1,7,6,5,4,3,2] => 011111 => 6
[2,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0] => [2,1,3,4,5,6,7] => 100000 => 6
[2,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0] => [2,1,3,4,5,7,6] => 100001 => 29
[2,1,1,2,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0] => [2,1,3,4,6,5,7] => 100010 => 78
[2,1,1,3] => [1,1,0,0,1,0,1,0,1,1,1,0,0,0] => [2,1,3,4,7,6,5] => 100011 => 55
[2,1,2,1,1] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0] => [2,1,3,5,4,6,7] => 100100 => 99
[2,1,2,2] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0] => [2,1,3,5,4,7,6] => 100101 => 181
[2,1,3,1] => [1,1,0,0,1,0,1,1,1,0,0,0,1,0] => [2,1,3,6,5,4,7] => 100110 => 132
>>> Load all 232 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 permutations whose descent word is the given binary word.
This is the sizes of the preimages of the map Mp00109descent word.
This is the sizes of the preimages of the map Mp00109descent word.
Map
bounce path
Description
The bounce path determined by an integer composition.
Map
to non-crossing permutation
Description
Sends a Dyck path $D$ with valley at positions $\{(i_1,j_1),\ldots,(i_k,j_k)\}$ to the unique non-crossing permutation $\pi$ having descents $\{i_1,\ldots,i_k\}$ and whose inverse has descents $\{j_1,\ldots,j_k\}$.
It sends the area St000012The area of a Dyck path. to the number of inversions St000018The number of inversions of a permutation. and the major index St000027The major index of a Dyck path. to $n(n-1)$ minus the sum of the major index St000004The major index of a permutation. and the inverse major index St000305The inverse major index of a permutation..
It sends the area St000012The area of a Dyck path. to the number of inversions St000018The number of inversions of a permutation. and the major index St000027The major index of a Dyck path. to $n(n-1)$ minus the sum of the major index St000004The major index of a permutation. and the inverse major index St000305The inverse major index of a permutation..
Map
descent word
Description
The descent positions of a permutation as a binary word.
For a permutation $\pi$ of $n$ letters and each $1\leq i\leq n-1$ such that $\pi(i) > \pi(i+1)$ we set $w_i=1$, otherwise $w_i=0$.
Thus, the length of the word is one less the size of the permutation. In particular, the descent word is undefined for the empty permutation.
For a permutation $\pi$ of $n$ letters and each $1\leq i\leq n-1$ such that $\pi(i) > \pi(i+1)$ we set $w_i=1$, otherwise $w_i=0$.
Thus, the length of the word is one less the size of the permutation. In particular, the descent word is undefined for the empty permutation.
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!