The degree of the cyclic sieving polynomial corresponding to an integer partition.
Let $\lambda$ be an integer partition of $n$ and let $N$ be the least common multiple of the parts of $\lambda$. Fix an arbitrary permutation $\pi$ of cycle type $\lambda$. Then $\pi$ induces a cyclic action of order $N$ on $\{1,\dots,n\}$.
The corresponding character can be identified with the cyclic sieving polynomial $C_\lambda(q)$ of this action, modulo $q^N-1$. Explicitly, it is
$$ \sum_{p\in\lambda} [p]_{q^{N/p}}, $$
where $[p]_q = 1+\dots+q^{p-1}$ is the $q$-integer.
This statistic records the degree of $C_\lambda(q)$. Equivalently, it equals
$$ \left(1 - \frac{1}{\lambda_1}\right) N, $$
where $\lambda_1$ is the largest part of $\lambda$.
The statistic is undefined for the empty partition.

Returns the Hasse diagram of the poset as an undirected graph.

Return the partition of the sizes of the connected components of the graph.

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.