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 number of augmented double ascents of a permutation. An augmented double ascent of a permutation $\pi$ is a double ascent of the augmented permutation $\tilde\pi$ obtained from $\pi$ by adding an initial $0$. A double ascent of $\tilde\pi$ then is a position $i$ such that $\tilde\pi(i) < \tilde\pi(i+1) < \tilde\pi(i+2)$.

The maximal sum of entries on a diagonal of an alternating sign matrix. For example, the sums of the diagonals of the matrix $$\left(\begin{array}{rrrr} 0 & 0 & 1 & 0 \\ 0 & 1 & 0 & 0 \\ 1 & 0 & -1 & 1 \\ 0 & 0 & 1 & 0 \end{array}\right)$$ are $(0,1,1,0,1,1,0)$, so the statistic is $1$. This is a natural extension of [[St000887]] to alternating sign matrices.

The maximal number of nonzero entries on a diagonal of an alternating sign matrix. For example, for the matrix $$\left(\begin{array}{rrrr} 0 & 0 & 1 & 0 \\ 0 & 1 & 0 & 0 \\ 1 & 0 & -1 & 1 \\ 0 & 0 & 1 & 0 \end{array}\right)$$ the numbers of nonzero entries are $(0,1,1,2,1,1,0)$, so the statistic is $2$. This is a natural extension of [[St000887]] to alternating sign matrices. See [[St000888]] for the maximal sums.

The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$.