Identifier
-
Mp00148:
Finite Cartan types
—to root poset⟶
Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St000474: Integer partitions ⟶ ℤ
Values
['A',1] => ([],1) => [1] => -1
['A',2] => ([(0,2),(1,2)],3) => [2,1] => 0
['B',2] => ([(0,3),(1,3),(3,2)],4) => [3,1] => 0
['G',2] => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6) => [5,1] => 0
['A',3] => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6) => [3,2,1] => 1
['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] => 1
['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] => 1
['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] => 2
['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] => 2
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
Dyson's crank of a partition.
Let $\lambda$ be a partition and let $o(\lambda)$ be the number of parts that are equal to 1 (St000475The number of parts equal to 1 in a partition.), and let $\mu(\lambda)$ be the number of parts that are strictly larger than $o(\lambda)$ (St000473The number of parts of a partition that are strictly bigger than the number of ones.). Dyson's crank is then defined as
$$crank(\lambda) = \begin{cases} \text{ largest part of }\lambda & o(\lambda) = 0\\ \mu(\lambda) - o(\lambda) & o(\lambda) > 0. \end{cases}$$
Let $\lambda$ be a partition and let $o(\lambda)$ be the number of parts that are equal to 1 (St000475The number of parts equal to 1 in a partition.), and let $\mu(\lambda)$ be the number of parts that are strictly larger than $o(\lambda)$ (St000473The number of parts of a partition that are strictly bigger than the number of ones.). Dyson's crank is then defined as
$$crank(\lambda) = \begin{cases} \text{ largest part of }\lambda & o(\lambda) = 0\\ \mu(\lambda) - o(\lambda) & o(\lambda) > 0. \end{cases}$$
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.
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
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.
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.
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!