Identifier
Values
['A',1] => ([],1) => ([],1) => [1] => 0
['A',2] => ([(0,2),(1,2)],3) => ([(0,2),(1,2)],3) => [3] => 2
['B',2] => ([(0,3),(1,3),(3,2)],4) => ([(0,3),(1,3),(2,3)],4) => [4] => 3
['G',2] => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6) => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6) => [6] => 5
['A',3] => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6) => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6) => [6] => 5
['B',3] => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9) => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9) => [9] => 8
['C',3] => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9) => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9) => [9] => 8
['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) => ([(0,8),(1,7),(2,5),(2,6),(3,7),(3,9),(4,8),(4,9),(5,7),(5,9),(6,8),(6,9)],10) => [10] => 9
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 $\lambda = (\lambda_1,\ldots,\lambda_k)$ can be decomposed into border strips. For $0 \leq j < \lambda_1$ let $n_j$ be the length of the border strip starting at $(\lambda_1-j,0)$.
The dinv adjustment is then defined by
$$\sum_{j:n_j > 0}(\lambda_1-1-j).$$
The following example is taken from Appendix B in [2]: Let $\lambda=(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 $(n_0,\ldots,n_4) = (10,7,0,3,1)$.
The dinv adjustment is thus $4+3+1+0 = 8$.
Map
to graph
Description
Returns the Hasse diagram of the poset as an undirected graph.
Map
to partition of connected components
Description
Return the partition of the sizes of the connected components of the graph.
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 $\alpha \prec \beta$ if $\beta - \alpha$ is a simple root.