Identifier
-
Mp00178:
Binary words
—to composition⟶
Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St001096: Permutations ⟶ ℤ
Values
0 => [2] => [1,1,0,0] => [1,2] => 1
1 => [1,1] => [1,0,1,0] => [2,1] => 1
00 => [3] => [1,1,1,0,0,0] => [1,2,3] => 2
01 => [2,1] => [1,1,0,0,1,0] => [3,1,2] => 1
10 => [1,2] => [1,0,1,1,0,0] => [2,3,1] => 1
11 => [1,1,1] => [1,0,1,0,1,0] => [3,2,1] => 2
000 => [4] => [1,1,1,1,0,0,0,0] => [1,2,3,4] => 3
001 => [3,1] => [1,1,1,0,0,0,1,0] => [4,1,2,3] => 1
010 => [2,2] => [1,1,0,0,1,1,0,0] => [3,4,1,2] => 2
011 => [2,1,1] => [1,1,0,0,1,0,1,0] => [4,3,1,2] => 1
100 => [1,3] => [1,0,1,1,1,0,0,0] => [2,3,4,1] => 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0] => [4,2,3,1] => 2
110 => [1,1,2] => [1,0,1,0,1,1,0,0] => [3,4,2,1] => 1
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0] => [4,3,2,1] => 3
0000 => [5] => [1,1,1,1,1,0,0,0,0,0] => [1,2,3,4,5] => 4
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0] => [5,1,2,3,4] => 1
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0] => [4,5,1,2,3] => 2
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [5,4,1,2,3] => 1
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0] => [3,4,5,1,2] => 2
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [5,3,4,1,2] => 2
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [4,5,3,1,2] => 2
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => [5,4,3,1,2] => 1
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0] => [2,3,4,5,1] => 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [5,2,3,4,1] => 2
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [4,5,2,3,1] => 2
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [5,4,2,3,1] => 2
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [3,4,5,2,1] => 1
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [5,3,4,2,1] => 2
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [4,5,3,2,1] => 1
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [5,4,3,2,1] => 4
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,2,3,4,5,6] => 5
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => [6,1,2,3,4,5] => 1
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => [5,6,1,2,3,4] => 2
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => [6,5,1,2,3,4] => 1
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [4,5,6,1,2,3] => 3
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => [6,4,5,1,2,3] => 1
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => [5,6,4,1,2,3] => 2
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => [6,5,4,1,2,3] => 1
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => [3,4,5,6,1,2] => 2
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => [6,3,4,5,1,2] => 2
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => [5,6,3,4,1,2] => 3
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => [6,5,3,4,1,2] => 1
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => [4,5,6,3,1,2] => 2
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => [6,4,5,3,1,2] => 2
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => [5,6,4,3,1,2] => 2
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0] => [6,5,4,3,1,2] => 1
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => [2,3,4,5,6,1] => 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [6,2,3,4,5,1] => 2
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => [5,6,2,3,4,1] => 2
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => [6,5,2,3,4,1] => 2
10100 => [1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => [4,5,6,2,3,1] => 1
10101 => [1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => [6,4,5,2,3,1] => 3
10110 => [1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => [5,6,4,2,3,1] => 2
10111 => [1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => [6,5,4,2,3,1] => 2
11000 => [1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => [3,4,5,6,2,1] => 1
11001 => [1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => [6,3,4,5,2,1] => 2
11010 => [1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => [5,6,3,4,2,1] => 1
11011 => [1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => [6,5,3,4,2,1] => 3
11100 => [1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => [4,5,6,3,2,1] => 1
11101 => [1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => [6,4,5,3,2,1] => 2
11110 => [1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => [5,6,4,3,2,1] => 1
11111 => [1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => [6,5,4,3,2,1] => 5
000000 => [7] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,2,3,4,5,6,7] => 6
000001 => [6,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => [7,1,2,3,4,5,6] => 1
000010 => [5,2] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0] => [6,7,1,2,3,4,5] => 2
000011 => [5,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0] => [7,6,1,2,3,4,5] => 1
000100 => [4,3] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0] => [5,6,7,1,2,3,4] => 3
000101 => [4,2,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0] => [7,5,6,1,2,3,4] => 1
000111 => [4,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0] => [7,6,5,1,2,3,4] => 1
001001 => [3,3,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0] => [7,4,5,6,1,2,3] => 2
001010 => [3,2,2] => [1,1,1,0,0,0,1,1,0,0,1,1,0,0] => [6,7,4,5,1,2,3] => 2
001011 => [3,2,1,1] => [1,1,1,0,0,0,1,1,0,0,1,0,1,0] => [7,6,4,5,1,2,3] => 1
001111 => [3,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0] => [7,6,5,4,1,2,3] => 1
010000 => [2,5] => [1,1,0,0,1,1,1,1,1,0,0,0,0,0] => [3,4,5,6,7,1,2] => 2
010101 => [2,2,2,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0] => [7,5,6,3,4,1,2] => 3
010111 => [2,2,1,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0] => [7,6,5,3,4,1,2] => 1
011111 => [2,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0] => [7,6,5,4,3,1,2] => 1
100000 => [1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [2,3,4,5,6,7,1] => 1
111111 => [1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [7,6,5,4,3,2,1] => 6
0000000 => [8] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [1,2,3,4,5,6,7,8] => 7
0000001 => [7,1] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0] => [8,1,2,3,4,5,6,7] => 1
0000010 => [6,2] => [1,1,1,1,1,1,0,0,0,0,0,0,1,1,0,0] => [7,8,1,2,3,4,5,6] => 2
0000011 => [6,1,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0] => [8,7,1,2,3,4,5,6] => 1
0000100 => [5,3] => [1,1,1,1,1,0,0,0,0,0,1,1,1,0,0,0] => [6,7,8,1,2,3,4,5] => 3
0000101 => [5,2,1] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0,1,0] => [8,6,7,1,2,3,4,5] => 1
0000111 => [5,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0] => [8,7,6,1,2,3,4,5] => 1
0001000 => [4,4] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0] => [5,6,7,8,1,2,3,4] => 4
0001001 => [4,3,1] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0,1,0] => [8,5,6,7,1,2,3,4] => 1
0001010 => [4,2,2] => [1,1,1,1,0,0,0,0,1,1,0,0,1,1,0,0] => [7,8,5,6,1,2,3,4] => 2
0001011 => [4,2,1,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0,1,0] => [8,7,5,6,1,2,3,4] => 1
0001111 => [4,1,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0] => [8,7,6,5,1,2,3,4] => 1
0010010 => [3,3,2] => [1,1,1,0,0,0,1,1,1,0,0,0,1,1,0,0] => [7,8,4,5,6,1,2,3] => 3
0010011 => [3,3,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,0] => [8,7,4,5,6,1,2,3] => 1
0010101 => [3,2,2,1] => [1,1,1,0,0,0,1,1,0,0,1,1,0,0,1,0] => [8,6,7,4,5,1,2,3] => 1
0010111 => [3,2,1,1,1] => [1,1,1,0,0,0,1,1,0,0,1,0,1,0,1,0] => [8,7,6,4,5,1,2,3] => 1
0011001 => [3,1,3,1] => [1,1,1,0,0,0,1,0,1,1,1,0,0,0,1,0] => [8,5,6,7,4,1,2,3] => 2
0011100 => [3,1,1,3] => [1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0] => [6,7,8,5,4,1,2,3] => 3
0011111 => [3,1,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0] => [8,7,6,5,4,1,2,3] => 1
0100000 => [2,6] => [1,1,0,0,1,1,1,1,1,1,0,0,0,0,0,0] => [3,4,5,6,7,8,1,2] => 2
0100010 => [2,4,2] => [1,1,0,0,1,1,1,1,0,0,0,0,1,1,0,0] => [7,8,3,4,5,6,1,2] => 3
0101000 => [2,2,4] => [1,1,0,0,1,1,0,0,1,1,1,1,0,0,0,0] => [5,6,7,8,3,4,1,2] => 2
>>> Load all 185 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 size of the overlap set of a permutation.
For a permutation $\pi\in\mathfrak S_n$ this is the number of indices $i < n$ such that the standardisation of $\pi_1\dots\pi_{n-i}$ equals the standardisation of $\pi_{i+1}\dots\pi_n$. In particular, for $n > 1$, the statistic is at least one, because the standardisations of $\pi_1$ and $\pi_n$ are both $1$.
For example, for $\pi=2143$, the standardisations of $21$ and $43$ are equal, and so are the standardisations of $2$ and $3$. Thus, the statistic on $\pi$ is $2$.
For a permutation $\pi\in\mathfrak S_n$ this is the number of indices $i < n$ such that the standardisation of $\pi_1\dots\pi_{n-i}$ equals the standardisation of $\pi_{i+1}\dots\pi_n$. In particular, for $n > 1$, the statistic is at least one, because the standardisations of $\pi_1$ and $\pi_n$ are both $1$.
For example, for $\pi=2143$, the standardisations of $21$ and $43$ are equal, and so are the standardisations of $2$ and $3$. Thus, the statistic on $\pi$ is $2$.
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
to 132-avoiding permutation
Description
Sends a Dyck path to a 132-avoiding permutation.
This bijection is defined in [1, Section 2].
This bijection is defined in [1, Section 2].
Map
bounce path
Description
The bounce path determined by 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!