Identifier
Values
[1] => [1,0,1,0] => [1,1,0,0] => [[2],[]] => 1
[2] => [1,1,0,0,1,0] => [1,1,1,0,0,0] => [[2,2],[]] => 1
[1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => [[2,2],[1]] => 2
[2,1] => [1,0,1,0,1,0] => [1,1,0,1,0,0] => [[3],[]] => 1
[1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,0,0,1,1,0,0] => [[3,2],[1]] => 2
[2,2] => [1,1,0,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => [[2,2,2],[1]] => 2
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,0,0,1,0,1,0] => [[2,2,2],[1,1]] => 2
[3,2] => [1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,0] => [[3,2],[]] => 1
[3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,0] => [[3,3],[1]] => 2
[2,2,1] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,0,1,0] => [[3,3],[2]] => 2
[2,1,1,1] => [1,0,1,1,1,0,1,0,0,0] => [1,1,0,0,1,1,0,1,0,0] => [[4,2],[1]] => 2
[3,2,1] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [[4],[]] => 1
[3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [[3,3,2],[2,1]] => 3
[2,2,1,1] => [1,0,1,1,0,1,1,0,0,0] => [1,1,0,0,1,0,1,1,0,0] => [[3,2,2],[1,1]] => 2
[3,2,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0] => [[2,2,2,2],[1,1,1]] => 2
[2,2,2,1] => [1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,0,1,1,0,0] => [[4,3],[2]] => 2
[3,2,2,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => [[3,3,3],[2,2]] => 2
[3,3,2,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => [[4,4],[3]] => 2
[4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [[5],[]] => 1
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 inner corners of a skew partition.
Map
promotion
Description
The promotion of the two-row standard Young tableau of a Dyck path.
Dyck paths of semilength $n$ are in bijection with standard Young tableaux of shape $(n^2)$, see Mp00033to two-row standard tableau.
This map is the bijection on such standard Young tableaux given by Schützenberger's promotion. For definitions and details, see [1] and the references therein.
Map
skew partition
Description
The parallelogram polyomino corresponding to a Dyck path, interpreted as a skew partition.
Let $D$ be a Dyck path of semilength $n$. The parallelogram polyomino $\gamma(D)$ is defined as follows: let $\tilde D = d_0 d_1 \dots d_{2n+1}$ be the Dyck path obtained by prepending an up step and appending a down step to $D$. Then, the upper path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with even indices, and the lower path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with odd indices.
This map returns the skew partition definded by the diagram of $\gamma(D)$.
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.