Identifier
-
Mp00148:
Finite Cartan types
—to root poset⟶
Posets
Mp00306: Posets —rowmotion cycle type⟶ Integer partitions
St000319: Integer partitions ⟶ ℤ (values match St000320The dinv adjustment of an integer partition.)
Values
['A',1] => ([],1) => [2] => 1
['A',2] => ([(0,2),(1,2)],3) => [3,2] => 2
['B',2] => ([(0,3),(1,3),(3,2)],4) => [4,2] => 3
['G',2] => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6) => [6,2] => 5
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 spin of an integer partition.
The Ferrers shape of an integer partition λ can be decomposed into border strips. The spin is then defined to be the total number of crossings of border strips of λ with the vertical lines in the Ferrers shape.
The following example is taken from Appendix B in [1]: Let λ=(5,5,4,4,2,1). Removing the border strips successively yields the sequence of partitions
(5,5,4,4,2,1),(4,3,3,1),(2,2),(1),().
The first strip (5,5,4,4,2,1)∖(4,3,3,1) crosses 4 times, the second strip (4,3,3,1)∖(2,2) crosses 3 times, the strip (2,2)∖(1) crosses 1 time, and the remaining strip (1)∖() does not cross.
This yields the spin of (5,5,4,4,2,1) to be 4+3+1=8.
The Ferrers shape of an integer partition λ can be decomposed into border strips. The spin is then defined to be the total number of crossings of border strips of λ with the vertical lines in the Ferrers shape.
The following example is taken from Appendix B in [1]: Let λ=(5,5,4,4,2,1). Removing the border strips successively yields the sequence of partitions
(5,5,4,4,2,1),(4,3,3,1),(2,2),(1),().
The first strip (5,5,4,4,2,1)∖(4,3,3,1) crosses 4 times, the second strip (4,3,3,1)∖(2,2) crosses 3 times, the strip (2,2)∖(1) crosses 1 time, and the remaining strip (1)∖() does not cross.
This yields the spin of (5,5,4,4,2,1) to be 4+3+1=8.
Map
rowmotion cycle type
Description
The cycle type of rowmotion on the order ideals of a poset.
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.
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!