The number of arithmetic progressions of length 2 in a permutation. For a permutation of length $n$, this is the number of indices $1 \leq i < j < k \leq n$ such that $\pi(k) - \pi(j) = \pi(j) - \pi(i)$.

The number of colourings of a cycle such that the multiplicities of colours are given by a partition. Two colourings are considered equal, if they are obtained by an action of the cyclic group. This statistic is only defined for partitions of size at least 3, to avoid ambiguity.

The Colin de Verdière graph invariant.

The largest multiplicity of a 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 $2$. The path on four vertices has eigenvalues $0, 4.7\dots, 6, 9.2\dots$ and therefore statistic $1$.

The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. Assign to each cell of the Ferrers diagram an arrow pointing north, east, south or west. Then compute for each cell the number of arrows pointing towards it, and take the minimum of those. This statistic is the maximal minimum that can be obtained by assigning arrows in any way.

The least common multiple of the parts of the partition.