Identifier
-
Mp00038:
Integer compositions
—reverse⟶
Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000862: Permutations ⟶ ℤ
Values
[1] => [1] => [1,0] => [1] => 1
[1,1] => [1,1] => [1,0,1,0] => [2,1] => 1
[2] => [2] => [1,1,0,0] => [1,2] => 1
[1,1,1] => [1,1,1] => [1,0,1,0,1,0] => [3,2,1] => 1
[1,2] => [2,1] => [1,1,0,0,1,0] => [3,1,2] => 2
[2,1] => [1,2] => [1,0,1,1,0,0] => [2,3,1] => 1
[3] => [3] => [1,1,1,0,0,0] => [1,2,3] => 1
[1,1,1,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0] => [4,3,2,1] => 1
[1,1,2] => [2,1,1] => [1,1,0,0,1,0,1,0] => [4,3,1,2] => 2
[1,2,1] => [1,2,1] => [1,0,1,1,0,0,1,0] => [4,2,3,1] => 2
[1,3] => [3,1] => [1,1,1,0,0,0,1,0] => [4,1,2,3] => 2
[2,1,1] => [1,1,2] => [1,0,1,0,1,1,0,0] => [3,4,2,1] => 1
[2,2] => [2,2] => [1,1,0,0,1,1,0,0] => [3,4,1,2] => 2
[3,1] => [1,3] => [1,0,1,1,1,0,0,0] => [2,3,4,1] => 1
[4] => [4] => [1,1,1,1,0,0,0,0] => [1,2,3,4] => 1
[1,1,1,1,1] => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [5,4,3,2,1] => 1
[1,1,1,2] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => [5,4,3,1,2] => 2
[1,1,2,1] => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [5,4,2,3,1] => 2
[1,1,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [5,4,1,2,3] => 2
[1,2,1,1] => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [5,3,4,2,1] => 2
[1,2,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [5,3,4,1,2] => 2
[1,3,1] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [5,2,3,4,1] => 2
[1,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0] => [5,1,2,3,4] => 2
[2,1,1,1] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [4,5,3,2,1] => 1
[2,1,2] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [4,5,3,1,2] => 2
[2,2,1] => [1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [4,5,2,3,1] => 2
[2,3] => [3,2] => [1,1,1,0,0,0,1,1,0,0] => [4,5,1,2,3] => 2
[3,1,1] => [1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [3,4,5,2,1] => 1
[3,2] => [2,3] => [1,1,0,0,1,1,1,0,0,0] => [3,4,5,1,2] => 2
[4,1] => [1,4] => [1,0,1,1,1,1,0,0,0,0] => [2,3,4,5,1] => 1
[5] => [5] => [1,1,1,1,1,0,0,0,0,0] => [1,2,3,4,5] => 1
[1,1,1,1,1,1] => [1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => [6,5,4,3,2,1] => 1
[1,1,1,1,2] => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0] => [6,5,4,3,1,2] => 2
[1,1,1,2,1] => [1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => [6,5,4,2,3,1] => 2
[1,1,1,3] => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => [6,5,4,1,2,3] => 2
[1,1,2,1,1] => [1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => [6,5,3,4,2,1] => 2
[1,1,2,2] => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => [6,5,3,4,1,2] => 2
[1,1,3,1] => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => [6,5,2,3,4,1] => 2
[1,1,4] => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => [6,5,1,2,3,4] => 2
[1,2,1,1,1] => [1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => [6,4,5,3,2,1] => 2
[1,2,1,2] => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => [6,4,5,3,1,2] => 2
[1,2,2,1] => [1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => [6,4,5,2,3,1] => 2
[1,2,3] => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => [6,4,5,1,2,3] => 3
[1,3,1,1] => [1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => [6,3,4,5,2,1] => 2
[1,3,2] => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => [6,3,4,5,1,2] => 2
[1,4,1] => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [6,2,3,4,5,1] => 2
[1,5] => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => [6,1,2,3,4,5] => 2
[2,1,1,1,1] => [1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => [5,6,4,3,2,1] => 1
[2,1,1,2] => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => [5,6,4,3,1,2] => 2
[2,1,2,1] => [1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => [5,6,4,2,3,1] => 2
[2,1,3] => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => [5,6,4,1,2,3] => 2
[2,2,1,1] => [1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => [5,6,3,4,2,1] => 2
[2,2,2] => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => [5,6,3,4,1,2] => 2
[2,3,1] => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => [5,6,2,3,4,1] => 2
[2,4] => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => [5,6,1,2,3,4] => 2
[3,1,1,1] => [1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => [4,5,6,3,2,1] => 1
[3,1,2] => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => [4,5,6,3,1,2] => 2
[3,2,1] => [1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => [4,5,6,2,3,1] => 2
[3,3] => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [4,5,6,1,2,3] => 2
[4,1,1] => [1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => [3,4,5,6,2,1] => 1
[4,2] => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => [3,4,5,6,1,2] => 2
[5,1] => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => [2,3,4,5,6,1] => 1
[6] => [6] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,2,3,4,5,6] => 1
[1,1,1,1,1,1,1] => [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] => 1
[1,1,1,1,1,2] => [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] => 2
[1,1,1,1,3] => [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] => 2
[1,1,1,2,2] => [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] => 2
[1,1,1,4] => [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] => 2
[1,1,2,3] => [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] => 3
[1,1,5] => [5,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0] => [7,6,1,2,3,4,5] => 2
[1,2,2,2] => [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] => 2
[1,2,4] => [4,2,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0] => [7,5,6,1,2,3,4] => 3
[1,3,3] => [3,3,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0] => [7,4,5,6,1,2,3] => 3
[1,6] => [6,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => [7,1,2,3,4,5,6] => 2
[2,2,3] => [3,2,2] => [1,1,1,0,0,0,1,1,0,0,1,1,0,0] => [6,7,4,5,1,2,3] => 3
[2,5] => [5,2] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0] => [6,7,1,2,3,4,5] => 2
[3,4] => [4,3] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0] => [5,6,7,1,2,3,4] => 2
[5,2] => [2,5] => [1,1,0,0,1,1,1,1,1,0,0,0,0,0] => [3,4,5,6,7,1,2] => 2
[6,1] => [1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [2,3,4,5,6,7,1] => 1
[7] => [7] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,2,3,4,5,6,7] => 1
[1,1,1,1,1,1,1,1] => [1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [8,7,6,5,4,3,2,1] => 1
[1,1,1,1,1,1,2] => [2,1,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0] => [8,7,6,5,4,3,1,2] => 2
[1,1,1,1,1,3] => [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] => 2
[1,1,1,1,2,2] => [2,2,1,1,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0,1,0] => [8,7,6,5,3,4,1,2] => 2
[1,1,1,1,4] => [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] => 2
[1,1,1,2,1,2] => [2,1,2,1,1,1] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0,1,0] => [8,7,6,4,5,3,1,2] => 2
[1,1,1,2,2,1] => [1,2,2,1,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0,1,0] => [8,7,6,4,5,2,3,1] => 2
[1,1,1,2,3] => [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] => 3
[1,1,1,5] => [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] => 2
[1,1,2,1,1,2] => [2,1,1,2,1,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0] => [8,7,5,6,4,3,1,2] => 2
[1,1,2,1,2,1] => [1,2,1,2,1,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0] => [8,7,5,6,4,2,3,1] => 2
[1,1,2,2,1,1] => [1,1,2,2,1,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0] => [8,7,5,6,3,4,2,1] => 2
[1,1,2,2,2] => [2,2,2,1,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0,1,0] => [8,7,5,6,3,4,1,2] => 2
[1,1,2,4] => [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] => 3
[1,1,3,3] => [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] => 3
[1,1,6] => [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] => 2
[1,2,1,1,1,2] => [2,1,1,1,2,1] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0,1,0] => [8,6,7,5,4,3,1,2] => 2
[1,2,1,1,2,1] => [1,2,1,1,2,1] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0] => [8,6,7,5,4,2,3,1] => 2
[1,2,1,2,1,1] => [1,1,2,1,2,1] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0,1,0] => [8,6,7,5,3,4,2,1] => 2
[1,2,2,1,1,1] => [1,1,1,2,2,1] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0,1,0] => [8,6,7,4,5,3,2,1] => 2
[1,2,2,3] => [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] => 3
>>> 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 number of parts of the shifted shape of a permutation.
The diagram of a strict partition $\lambda_1 < \lambda_2 < \dots < \lambda_\ell$ of $n$ is a tableau with $\ell$ rows, the $i$-th row being indented by $i$ cells. A shifted standard Young tableau is a filling of such a diagram, where entries in rows and columns are strictly increasing.
The shifted Robinson-Schensted algorithm [1] associates to a permutation a pair $(P, Q)$ of standard shifted Young tableaux of the same shape, where off-diagonal entries in $Q$ may be circled.
This statistic records the number of parts of the shifted shape.
The diagram of a strict partition $\lambda_1 < \lambda_2 < \dots < \lambda_\ell$ of $n$ is a tableau with $\ell$ rows, the $i$-th row being indented by $i$ cells. A shifted standard Young tableau is a filling of such a diagram, where entries in rows and columns are strictly increasing.
The shifted Robinson-Schensted algorithm [1] associates to a permutation a pair $(P, Q)$ of standard shifted Young tableaux of the same shape, where off-diagonal entries in $Q$ may be circled.
This statistic records the number of parts of the shifted shape.
Map
bounce path
Description
The bounce path determined by an integer composition.
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
reverse
Description
Return the reversal of a composition.
That is, the composition $(i_1, i_2, \ldots, i_k)$ is sent to $(i_k, i_{k-1}, \ldots, i_1)$.
That is, the composition $(i_1, i_2, \ldots, i_k)$ is sent to $(i_k, i_{k-1}, \ldots, i_1)$.
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!