Identifier
-
Mp00178:
Binary words
—to composition⟶
Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St001086: Permutations ⟶ ℤ
Values
0 => [2] => [1,1,0,0] => [2,1] => 0
1 => [1,1] => [1,0,1,0] => [1,2] => 0
00 => [3] => [1,1,1,0,0,0] => [3,1,2] => 0
01 => [2,1] => [1,1,0,0,1,0] => [2,1,3] => 0
10 => [1,2] => [1,0,1,1,0,0] => [1,3,2] => 1
11 => [1,1,1] => [1,0,1,0,1,0] => [1,2,3] => 0
000 => [4] => [1,1,1,1,0,0,0,0] => [4,1,2,3] => 0
001 => [3,1] => [1,1,1,0,0,0,1,0] => [3,1,2,4] => 0
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] => 0
100 => [1,3] => [1,0,1,1,1,0,0,0] => [1,4,2,3] => 1
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] => 1
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0] => [1,2,3,4] => 0
0000 => [5] => [1,1,1,1,1,0,0,0,0,0] => [5,1,2,3,4] => 0
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0] => [4,1,2,3,5] => 0
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0] => [3,1,2,5,4] => 1
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [3,1,2,4,5] => 0
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,3,4] => 1
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => 1
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] => 0
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0] => [1,5,2,3,4] => 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [1,4,2,3,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] => 1
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [1,2,5,3,4] => 1
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => 1
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => 1
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => 0
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0] => [6,1,2,3,4,5] => 0
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => [5,1,2,3,4,6] => 0
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => [4,1,2,3,6,5] => 1
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => [4,1,2,3,5,6] => 0
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [3,1,2,6,4,5] => 1
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => [3,1,2,5,4,6] => 1
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => [3,1,2,4,6,5] => 1
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => [3,1,2,4,5,6] => 0
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => [2,1,6,3,4,5] => 1
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => [2,1,5,3,4,6] => 1
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => [2,1,4,3,6,5] => 2
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => [2,1,4,3,5,6] => 1
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => [2,1,3,6,4,5] => 1
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => [2,1,3,5,4,6] => 1
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] => 0
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,6,2,3,4,5] => 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,5,2,3,4,6] => 1
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,4,2,3,6,5] => 2
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,4,2,3,5,6] => 1
10100 => [1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,4,5] => 2
10101 => [1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4,6] => 2
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] => 1
11000 => [1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,3,4,5] => 1
11001 => [1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,3,4,6] => 1
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,4,5] => 1
11101 => [1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,5,4,6] => 1
11110 => [1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,6,5] => 1
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] => 0
000000 => [7] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [7,1,2,3,4,5,6] => 0
000001 => [6,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => [6,1,2,3,4,5,7] => 0
000010 => [5,2] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0] => [5,1,2,3,4,7,6] => 1
000011 => [5,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0] => [5,1,2,3,4,6,7] => 0
000110 => [4,1,2] => [1,1,1,1,0,0,0,0,1,0,1,1,0,0] => [4,1,2,3,5,7,6] => 1
000111 => [4,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0] => [4,1,2,3,5,6,7] => 0
001110 => [3,1,1,2] => [1,1,1,0,0,0,1,0,1,0,1,1,0,0] => [3,1,2,4,5,7,6] => 1
001111 => [3,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0] => [3,1,2,4,5,6,7] => 0
010000 => [2,5] => [1,1,0,0,1,1,1,1,1,0,0,0,0,0] => [2,1,7,3,4,5,6] => 1
010001 => [2,4,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0] => [2,1,6,3,4,5,7] => 1
011000 => [2,1,4] => [1,1,0,0,1,0,1,1,1,1,0,0,0,0] => [2,1,3,7,4,5,6] => 1
011100 => [2,1,1,3] => [1,1,0,0,1,0,1,0,1,1,1,0,0,0] => [2,1,3,4,7,5,6] => 1
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] => 0
100000 => [1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [1,7,2,3,4,5,6] => 1
100010 => [1,4,2] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0] => [1,5,2,3,4,7,6] => 2
100100 => [1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0] => [1,4,2,3,7,5,6] => 2
100101 => [1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0] => [1,4,2,3,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,2,3,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,2,3,5,6,7] => 1
101000 => [1,2,4] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0] => [1,3,2,7,4,5,6] => 2
101001 => [1,2,3,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0] => [1,3,2,6,4,5,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] => 3
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,5,6] => 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] => 2
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] => 1
110000 => [1,1,5] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0] => [1,2,7,3,4,5,6] => 1
110001 => [1,1,4,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0] => [1,2,6,3,4,5,7] => 1
110010 => [1,1,3,2] => [1,0,1,0,1,1,1,0,0,0,1,1,0,0] => [1,2,5,3,4,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,3,4,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,5,6] => 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] => 1
111000 => [1,1,1,4] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,3,7,4,5,6] => 1
111001 => [1,1,1,3,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,3,6,4,5,7] => 1
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] => 1
>>> Load all 172 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 occurrences of the consecutive pattern 132 in a permutation.
This is the number of occurrences of the pattern $132$, where the matched entries are all adjacent.
This is the number of occurrences of the pattern $132$, where the matched entries are all adjacent.
Map
to 321-avoiding permutation (Krattenthaler)
Description
Krattenthaler's bijection to 321-avoiding permutations.
Draw the path of semilength $n$ in an $n\times n$ square matrix, starting at the upper left corner, with right and down steps, and staying below the diagonal. Then the permutation matrix is obtained by placing ones into the cells corresponding to the peaks of the path and placing ones into the remaining columns from left to right, such that the row indices of the cells increase.
Draw the path of semilength $n$ in an $n\times n$ square matrix, starting at the upper left corner, with right and down steps, and staying below the diagonal. Then the permutation matrix is obtained by placing ones into the cells corresponding to the peaks of the path and placing ones into the remaining columns from left to right, such that the row indices of the cells increase.
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!