The number of long braid edges in the graph of braid moves of a permutation. Given a permutation $\pi$, let $\operatorname{Red}(\pi)$ denote the set of reduced words for $\pi$ in terms of simple transpositions $s_i = (i,i+1)$. We now say that two reduced words are connected by a long braid move if they are obtained from each other by a modification of the form $s_i s_{i+1} s_i \leftrightarrow s_{i+1} s_i s_{i+1}$ as a consecutive subword of a reduced word. For example, the two reduced words $s_1s_3s_2s_3$ and $s_1s_2s_3s_2$ for $$(124) = (12)(34)(23)(34) = (12)(23)(34)(23)$$ share an edge because they are obtained from each other by interchanging $s_3s_2s_3 \leftrightarrow s_3s_2s_3$. This statistic counts the number of such short braid moves among all reduced words.

The number of zeros of the symmetric group character corresponding to the partition. For example, the character values of the irreducible representation $S^{(2,2)}$ are $2$ on the conjugacy classes $(4)$ and $(2,2)$, $0$ on the conjugacy classes $(3,1)$ and $(1,1,1,1)$, and $-1$ on the conjugacy class $(2,1,1)$. Therefore, the statistic on the partition $(2,2)$ is $2$.

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].

Difference between largest and smallest parts in a partition.

The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. For example, restricting $S_{(6,3)}$ to $\mathfrak S_8$ yields $$S_{(5,3)}\oplus S_{(6,2)}$$ of degrees (number of standard Young tableaux) 28 and 20, none of which are odd. Restricting to $\mathfrak S_7$ yields $$S_{(4,3)}\oplus 2S_{(5,2)}\oplus S_{(6,1)}$$ of degrees 14, 14 and 6. However, restricting to $\mathfrak S_6$ yields $$S_{(3,3)}\oplus 3S_{(4,2)}\oplus 3S_{(5,1)}\oplus S_6$$ of degrees 5,9,5 and 1. Therefore, the statistic on the partition $(6,3)$ gives 3. This is related to $2$-saturations of Welter's game, see [1, Corollary 1.2].

The size of a partition minus the hook length of the base cell. This is, the number of boxes in the diagram of a partition that are neither in the first row nor in the first column.