Difference between largest and smallest parts in a partition.

The number of standard desarrangement tableaux of shape equal to the given partition. A '''standard desarrangement tableau''' is a standard tableau whose first ascent is even. Here, an ascent of a standard tableau is an entry $i$ such that $i+1$ appears to the right or above $i$ in the tableau (with respect to English tableau notation). This is also the nullity of the random-to-random operator (and the random-to-top) operator acting on the simple module of the symmetric group indexed by the given partition. See also: * [[St000046]]: The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition * [[St000500]]: Eigenvalues of the random-to-random operator acting on the regular representation.

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

The number of parts from which one can substract 2 and still get an integer partition.

The number of lower covers of a partition in dominance order. According to [1], Corollary 2.4, the maximum number of elements one element (apparently for $n\neq 2$) can cover is $$ \frac{1}{2}(\sqrt{1+8n}-3) $$ and an element which covers this number of elements is given by $(c+i,c,c-1,\dots,3,2,1)$, where $1\leq i\leq c+2$.

The multiplicity of the irreducible representation indexed by the partition in the Kronecker square corresponding to the partition. The Kronecker coefficient is the multiplicity $g_{\mu,\nu}^\lambda$ of the Specht module $S^\lambda$ in $S^\mu\otimes S^\nu$: $$ S^\mu\otimes S^\nu = \bigoplus_\lambda g_{\mu,\nu}^\lambda S^\lambda $$ This statistic records the Kronecker coefficient $g_{\lambda,\lambda}^\lambda$.

The number of distinct parts of a partition that occur at least twice. See Section 3.3.1 of [2].

The number of upper covers of a partition in dominance order.

The exponens consonantiae of a partition. This is the quotient of the least common multiple and the greatest common divior of the parts of the partiton. See [1, Caput sextum, §19-§22].

The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition.