Identifier
-
Mp00231:
Integer compositions
—bounce path⟶
Dyck paths
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St001124: Integer partitions ⟶ ℤ (values match St000159The number of distinct parts of the integer partition., St000318The number of addable cells of the Ferrers diagram of an integer partition.)
Values
[1,2] => [1,0,1,1,0,0] => [1,0,1,1,0,0] => [1,1] => 0
[3] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => [2,1] => 1
[1,1,2] => [1,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0] => [1,1,1] => 0
[1,2,1] => [1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,0] => [1,1] => 0
[1,3] => [1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,0,0] => [2,2,1] => 1
[2,2] => [1,1,0,0,1,1,0,0] => [1,0,1,1,0,1,0,0] => [2,1,1] => 1
[3,1] => [1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,0,0] => [2,1] => 1
[4] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => [3,2,1] => 2
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1] => 0
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => [1,1,1] => 0
[1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [2,2,2,1] => 1
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,1,1,0,0,0,0] => [1,1] => 0
[1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,1,1,0,0,0] => [2,2,1,1] => 1
[1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,0] => [2,2,1] => 1
[1,4] => [1,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0] => [3,3,2,1] => 2
[2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,1,0,0,0] => [2,1,1,1] => 1
[2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [1,1,0,1,1,0,1,0,0,0] => [2,1,1] => 1
[2,3] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,0,1,1,0,1,0,0] => [3,2,2,1] => 2
[3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,1,0,1,0,0,0] => [2,1] => 1
[3,2] => [1,1,1,0,0,0,1,1,0,0] => [1,0,1,1,0,1,0,1,0,0] => [3,2,1,1] => 2
[4,1] => [1,1,1,1,0,0,0,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [3,2,1] => 2
[5] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => [4,3,2,1] => 3
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1] => 0
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => [1,1,1,1] => 0
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => [2,2,2,2,1] => 1
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => [1,1,1] => 0
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,1,1,1,0,0,0,0] => [2,2,2,1,1] => 1
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [2,2,2,1] => 1
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [3,3,3,2,1] => 2
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => [1,1] => 0
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,1,1,0,0,0,0] => [2,2,1,1,1] => 1
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => [2,2,1,1] => 1
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,0,1,0,1,1,0,1,1,0,0,0] => [3,3,2,2,1] => 2
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => [2,2,1] => 1
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,0,1,1,0,1,0,1,1,0,0,0] => [3,3,2,1,1] => 2
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [3,3,2,1] => 2
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => [4,4,3,2,1] => 3
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,0,1,0,0,0,0] => [2,1,1,1,1] => 1
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => [2,1,1,1] => 1
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,1,0,1,0,0,0] => [3,2,2,2,1] => 2
[2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => [2,1,1] => 1
[2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,1,1,0,1,0,0,0] => [3,2,2,1,1] => 2
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [3,2,2,1] => 2
[2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,1,0,0] => [4,3,3,2,1] => 3
[3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [2,1] => 1
[3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,1,0,1,0,0,0] => [3,2,1,1,1] => 2
[3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => [3,2,1,1] => 2
[3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [1,0,1,0,1,1,0,1,0,1,0,0] => [4,3,2,2,1] => 3
[4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [3,2,1] => 2
[4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => [1,0,1,1,0,1,0,1,0,1,0,0] => [4,3,2,1,1] => 3
[5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [4,3,2,1] => 3
[6] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => [5,4,3,2,1] => 4
[1,1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,1] => 0
[1,1,1,1,2,1] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1] => 0
[1,1,1,2,1,1] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1] => 0
[1,1,1,2,2] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,1,1,1,1,0,0,0,0,0] => [2,2,2,2,1,1] => 1
[1,1,1,3,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,1,1,1,0,0,0,0,0] => [2,2,2,2,1] => 1
[1,1,2,1,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,0,1,1,1,0,0,0,0,0,0] => [1,1,1] => 0
[1,1,2,1,2] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,1,1,1,0,0,0,0,0] => [2,2,2,1,1,1] => 1
[1,1,2,2,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,1,1,0,1,1,1,0,0,0,0,0] => [2,2,2,1,1] => 1
[1,1,3,1,1] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,1,0,1,1,1,0,0,0,0,0] => [2,2,2,1] => 1
[1,1,4,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,0,1,0,1,0,1,1,1,0,0,0,0] => [3,3,3,2,1] => 2
[1,2,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,1,1,0,0,0,0,0,0] => [1,1] => 0
[1,2,1,1,2] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,0,1,1,0,0,0,0,0] => [2,2,1,1,1,1] => 1
[1,2,1,2,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,1,0,1,1,0,0,0,0,0] => [2,2,1,1,1] => 1
[1,2,2,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0] => [1,1,1,0,1,1,0,1,1,0,0,0,0,0] => [2,2,1,1] => 1
[1,2,2,2] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,1,1,0,1,1,0,0,0,0] => [3,3,2,2,1,1] => 2
[1,2,3,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,1,0,1,1,0,0,0,0] => [3,3,2,2,1] => 2
[1,3,1,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0] => [1,1,1,1,0,1,0,1,1,0,0,0,0,0] => [2,2,1] => 1
[1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0] => [1,1,0,1,1,0,1,0,1,1,0,0,0,0] => [3,3,2,1,1] => 2
[1,4,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0] => [1,1,1,0,1,0,1,0,1,1,0,0,0,0] => [3,3,2,1] => 2
[1,5,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => [1,1,0,1,0,1,0,1,0,1,1,0,0,0] => [4,4,3,2,1] => 3
[2,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,1,0,1,0,0,0,0,0] => [2,1,1,1,1,1] => 1
[2,1,1,2,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,1,1,0,1,0,0,0,0,0] => [2,1,1,1,1] => 1
[2,1,2,1,1] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,1,1,1,0,1,0,0,0,0,0] => [2,1,1,1] => 1
[2,1,3,1] => [1,1,0,0,1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,1,1,0,1,0,0,0,0] => [3,2,2,2,1] => 2
[2,2,1,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,0,1,1,0,1,0,0,0,0,0] => [2,1,1] => 1
[2,2,1,2] => [1,1,0,0,1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,1,1,0,1,0,0,0,0] => [3,2,2,1,1,1] => 2
[2,2,2,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,1,1,0,1,1,0,1,0,0,0,0] => [3,2,2,1,1] => 2
[2,3,1,1] => [1,1,0,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,1,0,1,1,0,1,0,0,0,0] => [3,2,2,1] => 2
[2,4,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0] => [1,1,0,1,0,1,0,1,1,0,1,0,0,0] => [4,3,3,2,1] => 3
[3,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,1,0,1,0,0,0,0,0] => [2,1] => 1
[3,1,1,2] => [1,1,1,0,0,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,0,1,0,1,0,0,0,0] => [3,2,1,1,1,1] => 2
[3,1,2,1] => [1,1,1,0,0,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,1,0,1,0,1,0,0,0,0] => [3,2,1,1,1] => 2
[3,2,1,1] => [1,1,1,0,0,0,1,1,0,0,1,0,1,0] => [1,1,1,0,1,1,0,1,0,1,0,0,0,0] => [3,2,1,1] => 2
[3,3,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,1,0,1,0,1,0,0,0] => [4,3,2,2,1] => 3
[4,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0] => [1,1,1,1,0,1,0,1,0,1,0,0,0,0] => [3,2,1] => 2
[4,2,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0] => [1,1,0,1,1,0,1,0,1,0,1,0,0,0] => [4,3,2,1,1] => 3
[5,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0] => [1,1,1,0,1,0,1,0,1,0,1,0,0,0] => [4,3,2,1] => 3
[6,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,1,0,0] => [5,4,3,2,1] => 4
[1,1,1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1] => 0
[1,1,1,1,1,2,1] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,1,1,1,1,1] => 0
[1,1,1,1,2,1,1] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,1,1,1,1,1,0,0,0,0,0,0,0] => [1,1,1,1,1] => 0
[1,1,1,2,1,1,1] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,0,1,1,1,1,0,0,0,0,0,0,0] => [1,1,1,1] => 0
[1,1,1,2,2,1] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,1,1,0,1,1,1,1,0,0,0,0,0,0] => [2,2,2,2,1,1] => 1
[1,1,1,3,1,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,1,0,1,1,1,1,0,0,0,0,0,0] => [2,2,2,2,1] => 1
[1,1,2,1,1,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,1,1,1,0,0,0,0,0,0,0] => [1,1,1] => 0
[1,1,2,1,1,2] => [1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,0,1,1,1,0,0,0,0,0,0] => [2,2,2,1,1,1,1] => 1
[1,1,2,1,2,1] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,1,0,1,1,1,0,0,0,0,0,0] => [2,2,2,1,1,1] => 1
[1,1,2,2,1,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0] => [1,1,1,0,1,1,0,1,1,1,0,0,0,0,0,0] => [2,2,2,1,1] => 1
[1,1,3,1,1,1] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0,1,0] => [1,1,1,1,0,1,0,1,1,1,0,0,0,0,0,0] => [2,2,2,1] => 1
>>> Load all 197 entries. <<<
search for individual values
searching the database for the individual values of this statistic
Description
The multiplicity of the standard representation in the Kronecker square corresponding to a partition.
The Kronecker coefficient is the multiplicity $g_{\mu,\nu}^\lambda$ of the Specht module $S^\lambda$ in $S^\mu\otimes S^\nu$:
$$ S^\mu\otimes S^\nu = \bigoplus_\lambda g_{\mu,\nu}^\lambda S^\lambda $$
This statistic records the Kronecker coefficient $g_{\lambda,\lambda}^{(n-1)1}$, for $\lambda\vdash n > 1$. For $n\leq1$ the statistic is undefined.
It follows from [3, Prop.4.1] (or, slightly easier from [3, Thm.4.2]) that this is one less than St000159The number of distinct parts of the integer partition., the number of distinct parts of the partition.
The Kronecker coefficient is the multiplicity $g_{\mu,\nu}^\lambda$ of the Specht module $S^\lambda$ in $S^\mu\otimes S^\nu$:
$$ S^\mu\otimes S^\nu = \bigoplus_\lambda g_{\mu,\nu}^\lambda S^\lambda $$
This statistic records the Kronecker coefficient $g_{\lambda,\lambda}^{(n-1)1}$, for $\lambda\vdash n > 1$. For $n\leq1$ the statistic is undefined.
It follows from [3, Prop.4.1] (or, slightly easier from [3, Thm.4.2]) that this is one less than St000159The number of distinct parts of the integer partition., the number of distinct parts of the partition.
Map
to partition
Description
The cut-out partition of a Dyck path.
The partition $\lambda$ associated to a Dyck path is defined to be the complementary partition inside the staircase partition $(n-1,\ldots,2,1)$ when cutting out $D$ considered as a path from $(0,0)$ to $(n,n)$.
In other words, $\lambda_{i}$ is the number of down-steps before the $(n+1-i)$-th up-step of $D$.
This map is a bijection between Dyck paths of size $n$ and partitions inside the staircase partition $(n-1,\ldots,2,1)$.
The partition $\lambda$ associated to a Dyck path is defined to be the complementary partition inside the staircase partition $(n-1,\ldots,2,1)$ when cutting out $D$ considered as a path from $(0,0)$ to $(n,n)$.
In other words, $\lambda_{i}$ is the number of down-steps before the $(n+1-i)$-th up-step of $D$.
This map is a bijection between Dyck paths of size $n$ and partitions inside the staircase partition $(n-1,\ldots,2,1)$.
Map
bounce path
Description
The bounce path determined by an integer composition.
Map
inverse zeta map
Description
The inverse zeta map on Dyck paths.
See its inverse, the zeta map Mp00030zeta map, for the definition and details.
See its inverse, the zeta map Mp00030zeta map, for the definition and details.
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!