Identifier
-
Mp00233:
Dyck paths
—skew partition⟶
Skew partitions
Mp00186: Skew partitions —dominating partition⟶ Integer partitions
St000228: Integer partitions ⟶ ℤ
Values
[1,0] => [[1],[]] => [1] => 1
[1,0,1,0] => [[1,1],[]] => [1,1] => 2
[1,1,0,0] => [[2],[]] => [2] => 2
[1,0,1,0,1,0] => [[1,1,1],[]] => [1,1,1] => 3
[1,0,1,1,0,0] => [[2,1],[]] => [2,1] => 3
[1,1,0,0,1,0] => [[2,2],[1]] => [2,1] => 3
[1,1,0,1,0,0] => [[3],[]] => [3] => 3
[1,1,1,0,0,0] => [[2,2],[]] => [2,2] => 4
[1,0,1,0,1,0,1,0] => [[1,1,1,1],[]] => [1,1,1,1] => 4
[1,0,1,0,1,1,0,0] => [[2,1,1],[]] => [2,1,1] => 4
[1,0,1,1,0,0,1,0] => [[2,2,1],[1]] => [2,2] => 4
[1,0,1,1,0,1,0,0] => [[3,1],[]] => [3,1] => 4
[1,0,1,1,1,0,0,0] => [[2,2,1],[]] => [2,2,1] => 5
[1,1,0,0,1,0,1,0] => [[2,2,2],[1,1]] => [2,1,1] => 4
[1,1,0,0,1,1,0,0] => [[3,2],[1]] => [3,1] => 4
[1,1,0,1,0,0,1,0] => [[3,3],[2]] => [3,1] => 4
[1,1,0,1,0,1,0,0] => [[4],[]] => [4] => 4
[1,1,0,1,1,0,0,0] => [[3,3],[1]] => [3,2] => 5
[1,1,1,0,0,0,1,0] => [[2,2,2],[1]] => [2,2,1] => 5
[1,1,1,0,0,1,0,0] => [[3,2],[]] => [3,2] => 5
[1,1,1,0,1,0,0,0] => [[2,2,2],[]] => [2,2,2] => 6
[1,1,1,1,0,0,0,0] => [[3,3],[]] => [3,3] => 6
[1,0,1,0,1,0,1,0,1,0] => [[1,1,1,1,1],[]] => [1,1,1,1,1] => 5
[1,0,1,0,1,0,1,1,0,0] => [[2,1,1,1],[]] => [2,1,1,1] => 5
[1,0,1,0,1,1,0,0,1,0] => [[2,2,1,1],[1]] => [2,2,1] => 5
[1,0,1,0,1,1,0,1,0,0] => [[3,1,1],[]] => [3,1,1] => 5
[1,0,1,0,1,1,1,0,0,0] => [[2,2,1,1],[]] => [2,2,1,1] => 6
[1,0,1,1,0,0,1,0,1,0] => [[2,2,2,1],[1,1]] => [2,2,1] => 5
[1,0,1,1,0,0,1,1,0,0] => [[3,2,1],[1]] => [3,2] => 5
[1,0,1,1,0,1,0,0,1,0] => [[3,3,1],[2]] => [3,2] => 5
[1,0,1,1,0,1,0,1,0,0] => [[4,1],[]] => [4,1] => 5
[1,0,1,1,0,1,1,0,0,0] => [[3,3,1],[1]] => [3,3] => 6
[1,0,1,1,1,0,0,0,1,0] => [[2,2,2,1],[1]] => [2,2,2] => 6
[1,0,1,1,1,0,0,1,0,0] => [[3,2,1],[]] => [3,2,1] => 6
[1,0,1,1,1,0,1,0,0,0] => [[2,2,2,1],[]] => [2,2,2,1] => 7
[1,0,1,1,1,1,0,0,0,0] => [[3,3,1],[]] => [3,3,1] => 7
[1,1,0,0,1,0,1,0,1,0] => [[2,2,2,2],[1,1,1]] => [2,1,1,1] => 5
[1,1,0,0,1,0,1,1,0,0] => [[3,2,2],[1,1]] => [3,1,1] => 5
[1,1,0,0,1,1,0,0,1,0] => [[3,3,2],[2,1]] => [3,2] => 5
[1,1,0,0,1,1,0,1,0,0] => [[4,2],[1]] => [4,1] => 5
[1,1,0,0,1,1,1,0,0,0] => [[3,3,2],[1,1]] => [3,2,1] => 6
[1,1,0,1,0,0,1,0,1,0] => [[3,3,3],[2,2]] => [3,1,1] => 5
[1,1,0,1,0,0,1,1,0,0] => [[4,3],[2]] => [4,1] => 5
[1,1,0,1,0,1,0,0,1,0] => [[4,4],[3]] => [4,1] => 5
[1,1,0,1,0,1,0,1,0,0] => [[5],[]] => [5] => 5
[1,1,0,1,0,1,1,0,0,0] => [[4,4],[2]] => [4,2] => 6
[1,1,0,1,1,0,0,0,1,0] => [[3,3,3],[2,1]] => [3,2,1] => 6
[1,1,0,1,1,0,0,1,0,0] => [[4,3],[1]] => [4,2] => 6
[1,1,0,1,1,0,1,0,0,0] => [[3,3,3],[1,1]] => [3,2,2] => 7
[1,1,0,1,1,1,0,0,0,0] => [[4,4],[1]] => [4,3] => 7
[1,1,1,0,0,0,1,0,1,0] => [[2,2,2,2],[1,1]] => [2,2,1,1] => 6
[1,1,1,0,0,0,1,1,0,0] => [[3,2,2],[1]] => [3,2,1] => 6
[1,1,1,0,0,1,0,0,1,0] => [[3,3,2],[2]] => [3,3] => 6
[1,1,1,0,0,1,0,1,0,0] => [[4,2],[]] => [4,2] => 6
[1,1,1,0,0,1,1,0,0,0] => [[3,3,2],[1]] => [3,3,1] => 7
[1,1,1,0,1,0,0,0,1,0] => [[2,2,2,2],[1]] => [2,2,2,1] => 7
[1,1,1,0,1,0,0,1,0,0] => [[3,2,2],[]] => [3,2,2] => 7
[1,1,1,0,1,0,1,0,0,0] => [[2,2,2,2],[]] => [2,2,2,2] => 8
[1,1,1,0,1,1,0,0,0,0] => [[3,3,2],[]] => [3,3,2] => 8
[1,1,1,1,0,0,0,0,1,0] => [[3,3,3],[2]] => [3,3,1] => 7
[1,1,1,1,0,0,0,1,0,0] => [[4,3],[]] => [4,3] => 7
[1,1,1,1,0,0,1,0,0,0] => [[3,3,3],[1]] => [3,3,2] => 8
[1,1,1,1,0,1,0,0,0,0] => [[4,4],[]] => [4,4] => 8
[1,1,1,1,1,0,0,0,0,0] => [[3,3,3],[]] => [3,3,3] => 9
[1,0,1,0,1,0,1,0,1,0,1,0] => [[1,1,1,1,1,1],[]] => [1,1,1,1,1,1] => 6
[1,0,1,0,1,0,1,0,1,1,0,0] => [[2,1,1,1,1],[]] => [2,1,1,1,1] => 6
[1,0,1,0,1,0,1,1,0,0,1,0] => [[2,2,1,1,1],[1]] => [2,2,1,1] => 6
[1,0,1,0,1,0,1,1,0,1,0,0] => [[3,1,1,1],[]] => [3,1,1,1] => 6
[1,0,1,0,1,0,1,1,1,0,0,0] => [[2,2,1,1,1],[]] => [2,2,1,1,1] => 7
[1,0,1,0,1,1,0,0,1,0,1,0] => [[2,2,2,1,1],[1,1]] => [2,2,2] => 6
[1,0,1,0,1,1,0,0,1,1,0,0] => [[3,2,1,1],[1]] => [3,2,1] => 6
[1,0,1,0,1,1,0,1,0,0,1,0] => [[3,3,1,1],[2]] => [3,2,1] => 6
[1,0,1,0,1,1,0,1,0,1,0,0] => [[4,1,1],[]] => [4,1,1] => 6
[1,0,1,0,1,1,0,1,1,0,0,0] => [[3,3,1,1],[1]] => [3,3,1] => 7
[1,0,1,0,1,1,1,0,0,0,1,0] => [[2,2,2,1,1],[1]] => [2,2,2,1] => 7
[1,0,1,0,1,1,1,0,0,1,0,0] => [[3,2,1,1],[]] => [3,2,1,1] => 7
[1,0,1,0,1,1,1,0,1,0,0,0] => [[2,2,2,1,1],[]] => [2,2,2,1,1] => 8
[1,0,1,0,1,1,1,1,0,0,0,0] => [[3,3,1,1],[]] => [3,3,1,1] => 8
[1,0,1,1,0,0,1,0,1,0,1,0] => [[2,2,2,2,1],[1,1,1]] => [2,2,1,1] => 6
[1,0,1,1,0,0,1,0,1,1,0,0] => [[3,2,2,1],[1,1]] => [3,2,1] => 6
[1,0,1,1,0,0,1,1,0,0,1,0] => [[3,3,2,1],[2,1]] => [3,3] => 6
[1,0,1,1,0,0,1,1,0,1,0,0] => [[4,2,1],[1]] => [4,2] => 6
[1,0,1,1,0,0,1,1,1,0,0,0] => [[3,3,2,1],[1,1]] => [3,3,1] => 7
[1,0,1,1,0,1,0,0,1,0,1,0] => [[3,3,3,1],[2,2]] => [3,2,1] => 6
[1,0,1,1,0,1,0,0,1,1,0,0] => [[4,3,1],[2]] => [4,2] => 6
[1,0,1,1,0,1,0,1,0,0,1,0] => [[4,4,1],[3]] => [4,2] => 6
[1,0,1,1,0,1,0,1,0,1,0,0] => [[5,1],[]] => [5,1] => 6
[1,0,1,1,0,1,0,1,1,0,0,0] => [[4,4,1],[2]] => [4,3] => 7
[1,0,1,1,0,1,1,0,0,0,1,0] => [[3,3,3,1],[2,1]] => [3,3,1] => 7
[1,0,1,1,0,1,1,0,0,1,0,0] => [[4,3,1],[1]] => [4,3] => 7
[1,0,1,1,0,1,1,0,1,0,0,0] => [[3,3,3,1],[1,1]] => [3,3,2] => 8
[1,0,1,1,0,1,1,1,0,0,0,0] => [[4,4,1],[1]] => [4,4] => 8
[1,0,1,1,1,0,0,0,1,0,1,0] => [[2,2,2,2,1],[1,1]] => [2,2,2,1] => 7
[1,0,1,1,1,0,0,0,1,1,0,0] => [[3,2,2,1],[1]] => [3,2,2] => 7
[1,0,1,1,1,0,0,1,0,0,1,0] => [[3,3,2,1],[2]] => [3,3,1] => 7
[1,0,1,1,1,0,0,1,0,1,0,0] => [[4,2,1],[]] => [4,2,1] => 7
[1,0,1,1,1,0,0,1,1,0,0,0] => [[3,3,2,1],[1]] => [3,3,2] => 8
[1,0,1,1,1,0,1,0,0,0,1,0] => [[2,2,2,2,1],[1]] => [2,2,2,2] => 8
[1,0,1,1,1,0,1,0,0,1,0,0] => [[3,2,2,1],[]] => [3,2,2,1] => 8
[1,0,1,1,1,0,1,0,1,0,0,0] => [[2,2,2,2,1],[]] => [2,2,2,2,1] => 9
[1,0,1,1,1,0,1,1,0,0,0,0] => [[3,3,2,1],[]] => [3,3,2,1] => 9
>>> Load all 364 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 a partition.
This statistic is the constant statistic of the level sets.
This statistic is the constant statistic of the level sets.
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
dominating partition
Description
The dominating partition in the Schur expansion.
Consider the expansion of the skew Schur function $s_{\lambda/\mu}=\sum_\nu c^\lambda_{\mu, \nu} s_\nu$ as a linear combination of straight Schur functions.
It is shown in [1] that the partitions $\nu$ with $c^\lambda_{\mu, \nu} > 0$ form a sublattice of the dominance order and that its top element is the conjugate of the partition formed by sorting the column lengths of $\lambda / \mu$ into decreasing order.
This map returns the largest partition $\nu$ in dominance order for which $c^\lambda_{\mu, \nu}$ is positive.
For example,
$$ s_{331/2} = s_{311} + s_{32}, $$
and the partition $32$ dominates $311$.
Consider the expansion of the skew Schur function $s_{\lambda/\mu}=\sum_\nu c^\lambda_{\mu, \nu} s_\nu$ as a linear combination of straight Schur functions.
It is shown in [1] that the partitions $\nu$ with $c^\lambda_{\mu, \nu} > 0$ form a sublattice of the dominance order and that its top element is the conjugate of the partition formed by sorting the column lengths of $\lambda / \mu$ into decreasing order.
This map returns the largest partition $\nu$ in dominance order for which $c^\lambda_{\mu, \nu}$ is positive.
For example,
$$ s_{331/2} = s_{311} + s_{32}, $$
and the partition $32$ dominates $311$.
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!