Identifier
-
Mp00178:
Binary words
—to composition⟶
Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000402: Permutations ⟶ ℤ
Values
0 => [2] => [1,1,0,0] => [2,1] => 1
1 => [1,1] => [1,0,1,0] => [1,2] => 1
00 => [3] => [1,1,1,0,0,0] => [3,2,1] => 1
01 => [2,1] => [1,1,0,0,1,0] => [2,1,3] => 2
10 => [1,2] => [1,0,1,1,0,0] => [1,3,2] => 2
11 => [1,1,1] => [1,0,1,0,1,0] => [1,2,3] => 1
000 => [4] => [1,1,1,1,0,0,0,0] => [4,3,2,1] => 1
001 => [3,1] => [1,1,1,0,0,0,1,0] => [3,2,1,4] => 2
010 => [2,2] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => 1
011 => [2,1,1] => [1,1,0,0,1,0,1,0] => [2,1,3,4] => 2
100 => [1,3] => [1,0,1,1,1,0,0,0] => [1,4,3,2] => 2
101 => [1,2,1] => [1,0,1,1,0,0,1,0] => [1,3,2,4] => 1
110 => [1,1,2] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => 2
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0] => [1,2,3,4] => 1
0000 => [5] => [1,1,1,1,1,0,0,0,0,0] => [5,4,3,2,1] => 1
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0] => [4,3,2,1,5] => 2
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => 2
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [3,2,1,4,5] => 2
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => 2
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => 2
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => 1
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => 2
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0] => [1,5,4,3,2] => 2
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [1,4,3,2,5] => 1
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => 2
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => 2
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [1,2,5,4,3] => 2
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => 2
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => 2
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => 1
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0] => [6,5,4,3,2,1] => 1
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => [5,4,3,2,1,6] => 2
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => [4,3,2,1,6,5] => 2
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => [4,3,2,1,5,6] => 2
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [3,2,1,6,5,4] => 1
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => [3,2,1,5,4,6] => 2
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => [3,2,1,4,6,5] => 2
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => [3,2,1,4,5,6] => 2
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => [2,1,6,5,4,3] => 2
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => [2,1,5,4,3,6] => 2
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => [2,1,4,3,6,5] => 1
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => [2,1,4,3,5,6] => 2
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => [2,1,3,6,5,4] => 2
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => [2,1,3,5,4,6] => 2
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => [2,1,3,4,6,5] => 1
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0] => [2,1,3,4,5,6] => 2
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,6,5,4,3,2] => 2
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,5,4,3,2,6] => 1
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,4,3,2,6,5] => 2
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,4,3,2,5,6] => 2
10100 => [1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,5,4] => 2
10101 => [1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4,6] => 1
10110 => [1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,3,2,4,6,5] => 2
10111 => [1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,3,2,4,5,6] => 2
11000 => [1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,5,4,3] => 2
11001 => [1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,4,3,6] => 2
11010 => [1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => 2
11011 => [1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,4,3,5,6] => 1
11100 => [1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,6,5,4] => 2
11101 => [1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,5,4,6] => 2
11110 => [1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,6,5] => 2
11111 => [1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6] => 1
000000 => [7] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [7,6,5,4,3,2,1] => 1
000001 => [6,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => [6,5,4,3,2,1,7] => 2
000010 => [5,2] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0] => [5,4,3,2,1,7,6] => 2
000011 => [5,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0] => [5,4,3,2,1,6,7] => 2
000111 => [4,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0] => [4,3,2,1,5,6,7] => 2
001111 => [3,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0] => [3,2,1,4,5,6,7] => 2
010000 => [2,5] => [1,1,0,0,1,1,1,1,1,0,0,0,0,0] => [2,1,7,6,5,4,3] => 2
011111 => [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] => 2
100000 => [1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [1,7,6,5,4,3,2] => 2
100100 => [1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0] => [1,4,3,2,7,6,5] => 2
100101 => [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] => 2
100110 => [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] => 2
100111 => [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] => 2
101000 => [1,2,4] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0] => [1,3,2,7,6,5,4] => 2
101001 => [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] => 2
101010 => [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] => 2
101011 => [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] => 2
101100 => [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] => 2
101101 => [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] => 1
101110 => [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] => 2
101111 => [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] => 2
110000 => [1,1,5] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0] => [1,2,7,6,5,4,3] => 2
110001 => [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] => 2
110010 => [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] => 2
110011 => [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] => 1
110100 => [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] => 2
110101 => [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] => 2
110110 => [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] => 2
110111 => [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] => 2
111000 => [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] => 2
111001 => [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] => 2
111010 => [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] => 2
111011 => [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] => 2
111100 => [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] => 2
111101 => [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] => 2
111110 => [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] => 2
111111 => [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] => 1
0000000 => [8] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [8,7,6,5,4,3,2,1] => 1
0000001 => [7,1] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0] => [7,6,5,4,3,2,1,8] => 2
>>> Load all 167 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
Half the size of the symmetry class of a permutation.
The symmetry class of a permutation $\pi$ is the set of all permutations that can be obtained from $\pi$ by the three elementary operations inverse (Mp00066inverse), reverse (Mp00064reverse), and complement (Mp00069complement).
This statistic is undefined for the unique permutation on one element, because its value would be $1/2$.
The symmetry class of a permutation $\pi$ is the set of all permutations that can be obtained from $\pi$ by the three elementary operations inverse (Mp00066inverse), reverse (Mp00064reverse), and complement (Mp00069complement).
This statistic is undefined for the unique permutation on one element, because its value would be $1/2$.
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
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!