Your data matches 3 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001250
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St001250: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => [1]
 => 1
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => 2
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => 2
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => 2
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 2
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 2
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => [4,3,2,1]
 => 3
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => [7,5,3,1]
 => 3
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => [7,5,3,1]
 => 3
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => [5,3,3,1]
 => 2
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => [5,4,3,2,1]
 => 4
Description
The number of parts of a partition that are not congruent 0 modulo 3.
Matching statistic: St001124
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St001124: Integer partitions ⟶ ℤResult quality: 67% ●values known / values provided: 67%●distinct values known / distinct values provided: 75%
Values
['A',1]
 => ([],1)
 => [1]
 => []
 => ? = 1 - 1
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => [1]
 => ? = 2 - 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => [1]
 => ? = 1 - 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => [1]
 => ? = 2 - 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => [2,1]
 => 1 = 2 - 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => [3,1]
 => 1 = 2 - 1
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => [3,1]
 => 1 = 2 - 1
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => [4,3,2,1]
 => [3,2,1]
 => 2 = 3 - 1
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => [7,5,3,1]
 => [5,3,1]
 => 2 = 3 - 1
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => [7,5,3,1]
 => [5,3,1]
 => 2 = 3 - 1
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => [5,3,3,1]
 => [3,3,1]
 => 1 = 2 - 1
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => [5,4,3,2,1]
 => [4,3,2,1]
 => 3 = 4 - 1
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 [[St000159]], the number of distinct parts of the partition.
Matching statistic: St000897
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00306: Posets —rowmotion cycle type⟶ Integer partitions
Mp00044: Integer partitions —conjugate⟶ Integer partitions
St000897: Integer partitions ⟶ ℤResult quality: 33% ●values known / values provided: 33%●distinct values known / distinct values provided: 50%
Values
['A',1]
 => ([],1)
 => [2]
 => [1,1]
 => 1
['A',2]
 => ([(0,2),(1,2)],3)
 => [3,2]
 => [2,2,1]
 => 2
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [4,2]
 => [2,2,1,1]
 => 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [6,2]
 => [2,2,1,1,1,1]
 => 2
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [8,4,2]
 => [3,3,2,2,1,1,1,1]
 => ? = 2
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [6,6,6,2]
 => [4,4,3,3,3,3]
 => ? = 2
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [6,6,6,2]
 => [4,4,3,3,3,3]
 => ? = 2
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => [10,10,10,5,5,2]
 => [6,6,5,5,5,3,3,3,3,3]
 => ? = 3
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => [8,8,8,8,8,8,8,8,4,2]
 => [10,10,9,9,8,8,8,8]
 => ? = 3
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => [8,8,8,8,8,8,8,8,4,2]
 => [10,10,9,9,8,8,8,8]
 => ? = 3
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => [6,6,6,6,6,6,6,3,3,2]
 => [10,10,9,7,7,7]
 => ? = 2
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => [12,12,12,12,12,12,12,12,12,6,6,6,4,2]
 => [14,14,13,13,12,12,9,9,9,9,9,9]
 => ? = 4
Description
The number of different multiplicities of parts of an integer partition.