The number of semistandard tableaux on a given integer partition with minimal maximal entry.
This is, for an integer partition $\lambda = (\lambda_1 > \cdots > \lambda_k > 0)$, the number of semistandard tableaux of shape $\lambda$ with maximal entry $k$.
Equivalently, this is the evaluation $s_\lambda(1,\ldots,1)$ of the Schur function $s_\lambda$ in $k$ variables, or, explicitly,
$$ \prod_{(i,j) \in L} \frac{k + j - i}{ \operatorname{hook}(i,j) }$$
where the product is over all cells $(i,j) \in L$ and $\operatorname{hook}(i,j)$ is the hook length of a cell.
See [Theorem 6.3, 1] for details.

The cycle type of rowmotion on the order ideals of a poset.

Return the conjugate partition of the partition.
The conjugate partition of the partition $\lambda$ of $n$ is the partition $\lambda^*$ whose Ferrers diagram is obtained from the diagram of $\lambda$ by interchanging rows with columns.
This is also called the associated partition or the transpose in the literature.

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.