The number of standard Young tableaux whose descent set is the binary word. A descent in a standard Young tableau is an entry $i$ such that $i+1$ appears in a lower row in English notation. For example, the tableaux $[[1,2,4],[3]]$ and $[[1,2],[3,4]]$ are those with descent set $\{2\}$, corresponding to the binary word $010$.

The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. The distance Laplacian of a graph is the (symmetric) matrix with row and column sums $0$, which has the negative distances between two vertices as its off-diagonal entries. This statistic is the largest multiplicity of an eigenvalue. For example, the cycle on four vertices has distance Laplacian $$ \left(\begin{array}{rrrr} 4 & -1 & -2 & -1 \\ -1 & 4 & -1 & -2 \\ -2 & -1 & 4 & -1 \\ -1 & -2 & -1 & 4 \end{array}\right). $$ Its eigenvalues are $0,4,4,6$, so the statistic is $1$. The path on four vertices has eigenvalues $0, 4.7\dots, 6, 9.2\dots$ and therefore also statistic $1$. The graphs with statistic $n-1$, $n-2$ and $n-3$ have been characterised, see [1].

The Edelman-Greene number of a permutation. This is the sum of the coefficients of the expansion of the Stanley symmetric function $F_\omega$ in Schur functions. Equivalently, this is the number of semistandard tableaux whose column words - obtained by reading up columns starting with the leftmost - are reduced words for $\omega$.

The number of indecomposable projective-injective modules in the algebra corresponding to a subset. Let $A_n=K[x]/(x^n)$. We associate to a nonempty subset S of an (n-1)-set the module $M_S$, which is the direct sum of $A_n$-modules with indecomposable non-projective direct summands of dimension $i$ when $i$ is in $S$ (note that such modules have vector space dimension at most n-1). Then the corresponding algebra associated to S is the stable endomorphism ring of $M_S$. We decode the subset as a binary word so that for example the subset $S=\{1,3 \} $ of $\{1,2,3 \}$ is decoded as 101.

The number of graphs with the same chromatic polynomial.

The number of graphs with the same symmetric edge polytope as the given graph. The symmetric edge polytope of a graph on $n$ vertices is the polytope in $\mathbb R^n$ defined as the convex hull of $e_i - e_j$ and $e_j - e_i$ for each edge $(i, j)$, where $e_1,\dots, e_n$ denotes the standard basis.

The minimal number of occurrences of the split-pattern in a linear ordering of the vertices of the graph. A graph is a split graph if and only if in any linear ordering of its vertices, there are no three vertices $a < b < c$ such that $(a,b)$ is an edge and $(b,c)$ is not an edge. This statistic is the minimal number of occurrences of this pattern, in the set of all linear orderings of the vertices.

The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. A graph is outerplanar if and only if in any linear ordering of its vertices, there are no four vertices $a < b < c < d$ such that $(a,c)$ and $(b,d)$ are edges. This statistic is the minimal number of occurrences of this pattern, in the set of all linear orderings of the vertices.

The monophonic position number of a graph. A subset $M$ of the vertex set of a graph is a monophonic position set if no three vertices of $M$ lie on a common induced path. The monophonic position number is the size of a largest monophonic position set.