Identifier
Values
['A',1] => ([],1) => [1] => [1] => 0
['A',2] => ([(0,2),(1,2)],3) => [2,1] => [3] => 2
['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] => 1
['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] => 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] => [3,2,2,1,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] => [5,5] => 7
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 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.
Map
Greene-Kleitman invariant
Description
The Greene-Kleitman invariant of a poset.
This is the partition $(c_1 - c_0, c_2 - c_1, c_3 - c_2, \ldots)$, where $c_k$ is the maximum cardinality of a union of $k$ chains of the poset. Equivalently, this is the conjugate of the partition $(a_1 - a_0, a_2 - a_1, a_3 - a_2, \ldots)$, where $a_k$ is the maximum cardinality of a union of $k$ antichains of the poset.
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.