Identifier
-
Mp00142:
Dyck paths
—promotion⟶
Dyck paths
Mp00233: Dyck paths —skew partition⟶ Skew partitions
St001596: Skew partitions ⟶ ℤ
Values
[1,0] => [1,0] => [[1],[]] => 0
[1,0,1,0] => [1,1,0,0] => [[2],[]] => 0
[1,1,0,0] => [1,0,1,0] => [[1,1],[]] => 0
[1,0,1,0,1,0] => [1,1,0,1,0,0] => [[3],[]] => 0
[1,0,1,1,0,0] => [1,1,0,0,1,0] => [[2,2],[1]] => 0
[1,1,0,0,1,0] => [1,1,1,0,0,0] => [[2,2],[]] => 1
[1,1,0,1,0,0] => [1,0,1,0,1,0] => [[1,1,1],[]] => 0
[1,1,1,0,0,0] => [1,0,1,1,0,0] => [[2,1],[]] => 0
[1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [[4],[]] => 0
[1,0,1,0,1,1,0,0] => [1,1,0,1,0,0,1,0] => [[3,3],[2]] => 0
[1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,0] => [[3,3],[1]] => 1
[1,0,1,1,0,1,0,0] => [1,1,0,0,1,0,1,0] => [[2,2,2],[1,1]] => 0
[1,0,1,1,1,0,0,0] => [1,1,0,0,1,1,0,0] => [[3,2],[1]] => 0
[1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,0] => [[3,2],[]] => 1
[1,1,0,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => [[2,2,2],[1]] => 1
[1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,0] => [[2,2,2],[]] => 2
[1,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0] => [[1,1,1,1],[]] => 0
[1,1,0,1,1,0,0,0] => [1,0,1,0,1,1,0,0] => [[2,1,1],[]] => 0
[1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,0] => [[3,3],[]] => 2
[1,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,0] => [[2,2,1],[1]] => 0
[1,1,1,0,1,0,0,0] => [1,0,1,1,0,1,0,0] => [[3,1],[]] => 0
[1,1,1,1,0,0,0,0] => [1,0,1,1,1,0,0,0] => [[2,2,1],[]] => 1
[1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [[5],[]] => 0
[1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => [[4,4],[3]] => 0
[1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,1,0,0,0] => [[4,4],[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]] => 0
[1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,0,1,1,0,0] => [[4,3],[2]] => 0
[1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [[4,3],[1]] => 1
[1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => [[3,3,3],[2,1]] => 1
[1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,1,0,0,0] => [[3,3,3],[1,1]] => 2
[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]] => 0
[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]] => 0
[1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => [[4,4],[1]] => 2
[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]] => 0
[1,0,1,1,1,0,1,0,0,0] => [1,1,0,0,1,1,0,1,0,0] => [[4,2],[1]] => 0
[1,0,1,1,1,1,0,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [[3,3,2],[1,1]] => 1
[1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [[4,2],[]] => 1
[1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => [[3,3,2],[2]] => 1
[1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0] => [[3,3,2],[1]] => 2
[1,1,0,0,1,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0] => [[2,2,2,2],[1,1]] => 1
[1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,0,1,1,0,0] => [[3,2,2],[1]] => 1
[1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [[3,2,2],[]] => 2
[1,1,0,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => [[2,2,2,2],[1]] => 2
[1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => [[1,1,1,1,1],[]] => 0
[1,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,0,1,1,0,0] => [[2,1,1,1],[]] => 0
[1,1,0,1,1,0,0,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => [[2,2,1,1],[1]] => 0
[1,1,0,1,1,0,1,0,0,0] => [1,0,1,0,1,1,0,1,0,0] => [[3,1,1],[]] => 0
[1,1,0,1,1,1,0,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [[2,2,1,1],[]] => 1
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [[4,3],[]] => 2
[1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => [[3,3,3],[2]] => 2
[1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0] => [[2,2,2,1],[1,1]] => 0
[1,1,1,0,0,1,1,0,0,0] => [1,0,1,1,0,0,1,1,0,0] => [[3,2,1],[1]] => 0
[1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,0,1,0,0,1,0] => [[3,3,1],[2]] => 0
[1,1,1,0,1,0,1,0,0,0] => [1,0,1,1,0,1,0,1,0,0] => [[4,1],[]] => 0
[1,1,1,0,1,1,0,0,0,0] => [1,0,1,1,0,1,1,0,0,0] => [[3,3,1],[1]] => 1
[1,1,1,1,0,0,0,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => [[2,2,2,1],[1]] => 1
[1,1,1,1,0,0,1,0,0,0] => [1,0,1,1,1,0,0,1,0,0] => [[3,2,1],[]] => 1
[1,1,1,1,0,1,0,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => [[2,2,2,1],[]] => 2
[1,1,1,1,1,0,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [[3,3,1],[]] => 2
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [[6],[]] => 0
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0,1,0] => [[5,5],[4]] => 0
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [[5,5],[3]] => 1
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0,1,0] => [[4,4,4],[3,3]] => 0
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0,1,1,0,0] => [[5,4],[3]] => 0
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => [[5,4],[2]] => 1
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0,1,0] => [[4,4,4],[3,2]] => 1
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0,1,0] => [[3,3,3,3],[2,2,2]] => 0
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,0,0,1,0,1,1,0,0] => [[4,3,3],[2,2]] => 0
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,1,0,0,1,0] => [[4,4,3],[3,2]] => 0
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,0,0,1,1,0,1,0,0] => [[5,3],[2]] => 0
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,0,1,1,1,0,0,0] => [[4,4,3],[2,2]] => 1
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [[5,3],[1]] => 1
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,1,1,0,0,1,0,0,1,0] => [[4,4,3],[3,1]] => 1
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,0,1,0,1,0] => [[3,3,3,3],[2,2,1]] => 1
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,1,1,0,0,0,1,1,0,0] => [[4,3,3],[2,1]] => 1
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => [[2,2,2,2,2],[1,1,1,1]] => 0
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,0,0,1,0,1,0,1,1,0,0] => [[3,2,2,2],[1,1,1]] => 0
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => [[3,3,2,2],[2,1,1]] => 0
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,0,0,1,0,1,1,0,1,0,0] => [[4,2,2],[1,1]] => 0
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,1,1,0,0,0] => [[3,3,2,2],[1,1,1]] => 1
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => [[3,3,3,2],[2,2,1]] => 0
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => [[4,3,2],[2,1]] => 0
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,0,0,1,1,0,1,0,0,1,0] => [[4,4,2],[3,1]] => 0
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,0,0,1,1,0,1,0,1,0,0] => [[5,2],[1]] => 0
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,0,0,1,1,0,1,1,0,0,0] => [[4,4,2],[2,1]] => 1
[1,0,1,1,1,1,0,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => [[3,3,3,2],[2,1,1]] => 1
[1,0,1,1,1,1,0,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,1,0,0] => [[4,3,2],[1,1]] => 1
[1,1,0,0,1,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [[5,2],[]] => 1
[1,1,0,0,1,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,0,0,1,0] => [[4,4,2],[3]] => 1
[1,1,0,0,1,0,1,1,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0,1,0] => [[3,3,3,2],[2,2]] => 1
[1,1,0,0,1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0,1,1,0,0] => [[4,3,2],[2]] => 1
[1,1,0,0,1,1,0,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0,1,0] => [[2,2,2,2,2],[1,1,1]] => 1
[1,1,0,0,1,1,0,1,1,0,0,0] => [1,1,1,0,0,0,1,0,1,1,0,0] => [[3,2,2,2],[1,1]] => 1
[1,1,0,0,1,1,1,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => [[3,3,2,2],[2,1]] => 1
[1,1,0,0,1,1,1,0,1,0,0,0] => [1,1,1,0,0,0,1,1,0,1,0,0] => [[4,2,2],[1]] => 1
[1,1,0,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => [[1,1,1,1,1,1],[]] => 0
[1,1,0,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => [[2,1,1,1,1],[]] => 0
[1,1,0,1,0,1,1,0,0,1,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [[2,2,1,1,1],[1]] => 0
[1,1,0,1,0,1,1,0,1,0,0,0] => [1,0,1,0,1,0,1,1,0,1,0,0] => [[3,1,1,1],[]] => 0
[1,1,0,1,0,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [[2,2,1,1,1],[]] => 1
[1,1,0,1,1,0,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => [[2,2,2,1,1],[1,1]] => 0
>>> Load all 187 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 two-by-two squares inside a skew partition.
This is, the number of cells $(i,j)$ in a skew partition for which the box $(i+1,j+1)$ is also a cell inside the skew partition.
This is, the number of cells $(i,j)$ in a skew partition for which the box $(i+1,j+1)$ is also a cell inside the skew partition.
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)$.
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
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.
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.
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!