Identifier
-
Mp00148:
Finite Cartan types
—to root poset⟶
Posets
Mp00306: Posets —rowmotion cycle type⟶ Integer partitions
St000867: Integer partitions ⟶ ℤ
Values
['A',1] => ([],1) => [2] => 3
['A',2] => ([(0,2),(1,2)],3) => [3,2] => 8
['B',2] => ([(0,3),(1,3),(3,2)],4) => [4,2] => 12
['G',2] => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6) => [6,2] => 23
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 sum of the hook lengths in the first row of an integer partition.
For a cell in the Ferrers diagram of a partition, the hook length is given by the number of boxes to its right plus the number of boxes below plus one. This statistic is the sum of the hook lengths of the first row of a partition.
Put differently, for a partition of size $n$ with first parth $\lambda_1$, this is $\binom{\lambda_1}{2} + n$.
For a cell in the Ferrers diagram of a partition, the hook length is given by the number of boxes to its right plus the number of boxes below plus one. This statistic is the sum of the hook lengths of the first row of a partition.
Put differently, for a partition of size $n$ with first parth $\lambda_1$, this is $\binom{\lambda_1}{2} + n$.
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 $\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!