Identifier
-
Mp00148:
Finite Cartan types
—to root poset⟶
Posets
Mp00306: Posets —rowmotion cycle type⟶ Integer partitions
St000184: Integer partitions ⟶ ℤ
Values
['A',1] => ([],1) => [2] => 2
['A',2] => ([(0,2),(1,2)],3) => [3,2] => 6
['B',2] => ([(0,3),(1,3),(3,2)],4) => [4,2] => 8
['G',2] => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6) => [6,2] => 12
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 size of the centralizer of any permutation of given cycle type.
The centralizer (or commutant, equivalently normalizer) of an element $g$ of a group $G$ is the set of elements of $G$ that commute with $g$:
$$C_g = \{h \in G : hgh^{-1} = g\}.$$
Its size thus depends only on the conjugacy class of $g$.
The conjugacy classes of a permutation is determined by its cycle type, and the size of the centralizer of a permutation with cycle type $\lambda = (1^{a_1},2^{a_2},\dots)$ is
$$|C| = \Pi j^{a_j} a_j!$$
For example, for any permutation with cycle type $\lambda = (3,2,2,1)$,
$$|C| = (3^1 \cdot 1!)(2^2 \cdot 2!)(1^1 \cdot 1!) = 24.$$
There is exactly one permutation of the empty set, the identity, so the statistic on the empty partition is $1$.
The centralizer (or commutant, equivalently normalizer) of an element $g$ of a group $G$ is the set of elements of $G$ that commute with $g$:
$$C_g = \{h \in G : hgh^{-1} = g\}.$$
Its size thus depends only on the conjugacy class of $g$.
The conjugacy classes of a permutation is determined by its cycle type, and the size of the centralizer of a permutation with cycle type $\lambda = (1^{a_1},2^{a_2},\dots)$ is
$$|C| = \Pi j^{a_j} a_j!$$
For example, for any permutation with cycle type $\lambda = (3,2,2,1)$,
$$|C| = (3^1 \cdot 1!)(2^2 \cdot 2!)(1^1 \cdot 1!) = 24.$$
There is exactly one permutation of the empty set, the identity, so the statistic on the empty partition is $1$.
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.
Map
rowmotion cycle type
Description
The cycle type of rowmotion on the order ideals of a poset.
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!