The side length of the largest cube contained in a plane partition. A plane partition analogue of the Durfee square of an integer partition ([[St000183]]).

The descent variation of a composition. Defined in [1].

The number of nesting-similar perfect matchings of a perfect matching. Consider the infinite tree $T$ defined in [1] as follows. $T$ has the perfect matchings on $\{1,\dots,2n\}$ on level $n$, with children obtained by inserting an arc with opener $1$. For example, the matching $[(1,2)]$ has the three children $[(1,2),(3,4)]$, $[(1,3),(2,4)]$ and $[(1,4),(2,3)]$. Two perfect matchings $M$ and $N$ on $\{1,\dots,2n\}$ are nesting-similar, if the distribution of the number of nestings agrees on all levels of the subtrees of $T$ rooted at $M$ and $N$. [thm 1.2, 1] shows that to find out whether $M$ and $N$ are nesting-similar, it is enough to check that $M$ and $N$ have the same number of nestings, and that the distribution of nestings agrees for their direct children. [thm 3.5, 1], see also [2], gives the number of equivalence classes of nesting-similar matchings with $n$ arcs as $$2\cdot 4^{n-1} - \frac{3n-1}{2n+2}\binom{2n}{n}.$$ [prop 3.6, 1] has further interpretations of this number.

The number of flips required to make a perfect matching noncrossing. A crossing in a perfect matching is a pair of arcs $\{a,b\}$ and $\{c,d\}$ such that $a < c < b < d$. Replacing any such pair by either $\{a,c\}$ and $\{b,d\}$ or by $\{a,d\}$, $\{b,c\}$ produces a perfect matching with fewer crossings. This statistic is the minimal number of such flips required to turn a given matching into a noncrossing matching.

The decomposition (or block) number of a permutation. For $\pi \in \mathcal{S}_n$, this is given by $$\#\big\{ 1 \leq k \leq n : \{\pi_1,\ldots,\pi_k\} = \{1,\ldots,k\} \big\}.$$ This is also known as the number of connected components [1] or the number of blocks [2] of the permutation, considering it as a direct sum. This is one plus [[St000234]].