Identifier
-
Mp00148:
Finite Cartan types
—to root poset⟶
Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00321: Integer partitions —2-conjugate⟶ Integer partitions
St000936: Integer partitions ⟶ ℤ
Values
['A',2] => ([(0,2),(1,2)],3) => [2,1] => [3] => 0
['B',2] => ([(0,3),(1,3),(3,2)],4) => [3,1] => [2,1,1] => 1
['G',2] => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6) => [5,1] => [2,2,1,1] => 4
['A',3] => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6) => [3,2,1] => [3,3] => 3
['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,2,2,1,1] => 24
['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,2,2,1,1] => 24
['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] => [5,5] => 28
['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,2,2,1,1] => 50
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 even values of the symmetric group character corresponding to the partition.
For example, the character values of the irreducible representation S(2,2) are 2 on the conjugacy classes (4) and (2,2), 0 on the conjugacy classes (3,1) and (1,1,1,1), and −1 on the conjugace class (2,1,1). Therefore, the statistic on the partition (2,2) is 4.
It is shown in [1] that the sum of the values of the statistic over all partitions of a given size is even.
For example, the character values of the irreducible representation S(2,2) are 2 on the conjugacy classes (4) and (2,2), 0 on the conjugacy classes (3,1) and (1,1,1,1), and −1 on the conjugace class (2,1,1). Therefore, the statistic on the partition (2,2) is 4.
It is shown in [1] that the sum of the values of the statistic over all partitions of a given size is even.
Map
2-conjugate
Description
Return a partition with the same number of odd parts and number of even parts interchanged with the number of cells with zero leg and odd arm length.
This is a special case of an involution that preserves the sequence of non-zero remainders of the parts under division by s and interchanges the number of parts divisible by s and the number of cells with zero leg length and arm length congruent to s−1 modulo s.
In particular, for s=1 the involution is conjugation, hence the name.
This is a special case of an involution that preserves the sequence of non-zero remainders of the parts under division by s and interchanges the number of parts divisible by s and the number of cells with zero leg length and arm length congruent to s−1 modulo s.
In particular, for s=1 the involution is conjugation, hence the name.
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.
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 (c1−c0,c2−c1,c3−c2,…), where ck is the maximum cardinality of a union of k chains of the poset. Equivalently, this is the conjugate of the partition (a1−a0,a2−a1,a3−a2,…), where ak is the maximum cardinality of a union of k antichains of the poset.
This is the partition (c1−c0,c2−c1,c3−c2,…), where ck is the maximum cardinality of a union of k chains of the poset. Equivalently, this is the conjugate of the partition (a1−a0,a2−a1,a3−a2,…), where ak is the maximum cardinality of a union of k antichains of the poset.
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!