Processing math: 100%

Identifier
Values
['A',2] => ([(0,2),(1,2)],3) => [2,1] => [1,1,1] => 0
['B',2] => ([(0,3),(1,3),(3,2)],4) => [3,1] => [3,1] => 1
['G',2] => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6) => [5,1] => [5,1] => 1
['A',3] => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6) => [3,2,1] => [3,1,1,1] => 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] => [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] => [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,1,1,1,1,1,1,1] => 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
click to show known generating functions       
Description
The multiplicity of the standard representation in the Kronecker square corresponding to a partition.
The Kronecker coefficient is the multiplicity gλμ,ν of the Specht module Sλ in SμSν:
SμSν=λgλμ,νSλ
This statistic records the Kronecker coefficient g(n1)1λ,λ, for λn>1. For n1 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
Glaisher-Franklin inverse
Description
The Glaisher-Franklin bijection on integer partitions.
This map sends the number of distinct repeated part sizes to the number of distinct even part sizes, see [1, 3.3.1].
Map
to root poset
Description
The root poset of a finite Cartan type.
This is the poset on the set of positive roots of its root system where αβ if βα is a simple root.
Map
Greene-Kleitman invariant
Description
The Greene-Kleitman invariant of a poset.
This is the partition (c1c0,c2c1,c3c2,), where ck is the maximum cardinality of a union of k chains of the poset. Equivalently, this is the conjugate of the partition (a1a0,a2a1,a3a2,), where ak is the maximum cardinality of a union of k antichains of the poset.