The number of 2-regular simple modules in the incidence algebra of the lattice.

Number of indecomposable injective modules with projective dimension 2.

The number of 1/3-balanced pairs in a poset. A pair of elements $x,y$ of a poset is $\alpha$-balanced if the proportion of linear extensions where $x$ comes before $y$ is between $\alpha$ and $1-\alpha$. Kislitsyn [1] conjectured that every poset which is not a chain has a $1/3$-balanced pair. Brightwell, Felsner and Trotter [2] show that at least a $(1-\sqrt 5)/10$-balanced pair exists in posets which are not chains. Olson and Sagan [3] show that posets corresponding to skew Ferrers diagrams have a $1/3$-balanced pair.

Number of pairs of incomparable elements in a finite poset. For a finite poset $(P,\leq)$, this is the number of unordered pairs $\{x,y\} \in \binom{P}{2}$ with $x \not\leq y$ and $y \not\leq x$.

The number of simple modules with projective dimension two in the incidence algebra of the poset.

The weighted size of a partition. Let $\lambda = (\lambda_0\geq\lambda_1 \geq \dots\geq\lambda_m)$ be an integer partition. Then the weighted size of $\lambda$ is $$\sum_{i=0}^m i \cdot \lambda_i.$$ This is also the sum of the leg lengths of the cells in $\lambda$, or $$\sum_i \binom{\lambda^{\prime}_i}{2}$$ where $\lambda^{\prime}$ is the conjugate partition of $\lambda$. This is the minimal number of inversions a permutation with the given shape can have, see [1, cor.2.2]. This is also the smallest possible sum of the entries of a semistandard tableau (allowing 0 as a part) of shape $\lambda=(\lambda_0,\lambda_1,\ldots,\lambda_m)$, obtained uniquely by placing $i-1$ in all the cells of the $i$th row of $\lambda$, see [2, eq.7.103].

The size of a minimal vertex cover of a graph. A '''vertex cover''' of a graph $G$ is a subset $S$ of the vertices of $G$ such that each edge of $G$ contains at least one vertex of $S$. Finding a minimal vertex cover is an NP-hard optimization problem.

The matching number of a graph. For a graph $G$, this is defined as the maximal size of a '''matching''' or '''independent edge set''' (a set of edges without common vertices) contained in $G$.

The number of positive eigenvalues of the adjacency matrix of the graph.