The positive Catalan number of an irreducible finite Cartan type. The positive Catalan number of an irreducible finite Cartan type is defined as the product $$ Cat^+(W) = \prod_{i=1}^n \frac{d_i-2+h}{d_i} = \prod_{i=1}^n \frac{d^*_i+h}{d_i}$$ where * $W$ is the Weyl group of the given Cartan type, * $n$ is the rank of $W$, * $d_1 \leq d_2 \leq \ldots \leq d_n$ are the degrees of the fundamental invariants of $W$, * $d^*_1 \geq d^*_2 \geq \ldots \geq d^*_n$ are the codegrees for $W$, see [2], and * $h = d_n$ is the corresponding Coxeter number. The positive Catalan number $Cat^+(W)$ counts various combinatorial objects, among which are * noncrossing partitions of full Coxeter support inside $W$, * antichains not containing simple roots in the root poset, * bounded regions within the fundamental chamber in the Shi arrangement. For a detailed treatment and further references, see [1].

The number of maximal antichains in a poset.

The number of modular elements of a lattice. A pair $(x, y)$ of elements of a lattice $L$ is a modular pair if for every $z\geq y$ we have that $(y\vee x) \wedge z = y \vee (x \wedge z)$. An element $x$ is left-modular if $(x, y)$ is a modular pair for every $y\in L$, and is modular if both $(x, y)$ and $(y, x)$ are modular pairs for every $y\in L$.

The number of left modular elements of a lattice. A pair $(x, y)$ of elements of a lattice $L$ is a modular pair if for every $z\geq y$ we have that $(y\vee x) \wedge z = y \vee (x \wedge z)$. An element $x$ is left-modular if $(x, y)$ is a modular pair for every $y\in L$.

The number of partitions of the same length below the given integer partition. For a partition $\lambda_1 \geq \dots \lambda_k > 0$, this number is $$ \det\left( \binom{\lambda_{k+1-i}}{j-i+1} \right)_{1 \le i,j \le k}.$$

The number of neutral elements in a lattice. An element $e$ of the lattice $L$ is neutral if the sublattice generated by $e$, $x$ and $y$ is distributive for all $x, y \in L$.

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.

The number of [[/StandardTableaux|standard Young tableaux]] of the partition.

The number of elements in the poset.

The chromatic index of a graph. This is the minimal number of colours needed such that no two adjacent edges have the same colour.