Sum of lengths of inversions in permutations (Q686439)

Let \(\pi(1),\pi(2),\dots,\pi(n)\) and \(\sigma(1),\sigma(2),\dots,\sigma(n)\) be two permutations of the set \(\{1,2,\dots,n\}\). In connection with some order statistical investigations, Spearman introduced the quantity \[ S(\pi,\sigma)= \sum^ n_{i=1} \bigl(\pi^{-1}(i)- \sigma^{-1}(i)\bigr)^ 2 \] and studied its properties. In the present paper we consider some similar quantities defined by permutations. One of them is the sum of lengths of inversions, that is, \[ \text{SLI}(\pi,\sigma)= \sum_{{1\leq i< j\leq n\atop \pi^{- 1}(i)\sigma(i)>\pi^{-1}(j)\sigma(j)}} \bigl(\pi^{-1}(i)\sigma(i)- \pi^{-1}(j)\sigma(j)\bigr). \] On the other hand, we show some connections between \(\text{SLI}(\pi,\sigma)\) and a certain partial ordering of permutations.