The rcb statistic of a set partition. Let $S = B_1,\ldots,B_k$ be a set partition with ordered blocks $B_i$ and with $\operatorname{min} B_a < \operatorname{min} B_b$ for $a < b$. According to [1, Definition 3], a '''rcb''' (right-closer-bigger) of $S$ is given by a pair $i < j$ such that $j = \operatorname{max} B_b$ and $i \in B_a$ for $a < b$.

The los statistic of a set partition. Let $S = B_1,\ldots,B_k$ be a set partition with ordered blocks $B_i$ and with $\operatorname{min} B_a < \operatorname{min} B_b$ for $a < b$. According to [1, Definition 3], a '''los''' (left-opener-smaller) of $S$ is given by a pair $i > j$ such that $j = \operatorname{min} B_b$ and $i \in B_a$ for $a > b$. This is also the dual major index of [2].

The intertwining number of a set partition. This is defined in [1] as follows: for $\operatorname{int}(a,b) = \{ \min(a,b) < j < \max(a,b) \}$, the '''block intertwiners''' of two disjoint sets $A,B$ of integers is given by $$\{ (a,b) \in A\times B : \operatorname{int}(a,b) \cap A \cup B = \emptyset \}.$$ The intertwining number of a set partition $S$ is now the number of intertwiners of all pairs of blocks of $S$.