Processing math: 100%

Identifier
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
click to show known generating functions       
Description
The dinv adjustment of an integer partition.
The Ferrers shape of an integer partition λ=(λ1,,λk) can be decomposed into border strips. For 0j<λ1 let nj be the length of the border strip starting at (λ1j,0).
The dinv adjustment is then defined by
j:nj>0(λ11j).
The following example is taken from Appendix B in [2]: 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),(),
and we obtain (n0,,n4)=(10,7,0,3,1).
The dinv adjustment is thus 4+3+1+0=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.