The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. The statistic counting all pairs of distinct tunnels is the area of a Dyck path [[St000012]].

The hat guessing number of a graph. Suppose that each vertex of a graph corresponds to a player, wearing a hat whose color is arbitrarily chosen from a set of $q$ possible colors. Each player can see the hat colors of his neighbors, but not his own hat color. All of the players are asked to guess their own hat colors simultaneously, according to a predetermined guessing strategy and the hat colors they see, where no communication between them is allowed. The hat guessing number $HG(G)$ of a graph $G$ is the largest integer $q$ such that there exists a guessing strategy guaranteeing at least one correct guess for any hat assignment of $q$ possible colors. Because it suffices that a single player guesses correctly, the hat guessing number of a graph is the maximum of the hat guessing numbers of its connected components.

The interval resolution global dimension of a poset. This is the cardinality of the longest chain of right minimal approximations by interval modules of an indecomposable module over the incidence algebra.

The dimension of $Ext_A^1(A/AeA,A)$ in the corresponding Nakayama algebra $A$ such that $eA$ is a minimal faithful projective-injective module.

Eigenvalues of the top-to-random operator acting on a simple module. These eigenvalues are given in [1] and [3]. The simple module of the symmetric group indexed by a partition $\lambda$ has dimension equal to the number of standard tableaux of shape $\lambda$. Hence, the eigenvalues of any linear operator defined on this module can be indexed by standard tableaux of shape $\lambda$; this statistic gives all the eigenvalues of the operator acting on the module. This statistic bears different names, such as the type in [2] or eig in [3]. Similarly, the eigenvalues of the random-to-random operator acting on a simple module is [[St000508]].