The inversion sum of a permutation. A pair $a < b$ is an inversion of a permutation $\pi$ if $\pi(a) > \pi(b)$. The inversion sum is given by $\sum(b-a)$ over all inversions of $\pi$. This is also half of the metric associated with Spearmans coefficient of association $\rho$, $\sum_i (\pi_i - i)^2$, see [5]. This is also equal to the total number of occurrences of the classical permutation patterns $[2,1], [2, 3, 1], [3, 1, 2]$, and $[3, 2, 1]$, see [2]. This is also equal to the rank of the permutation inside the alternating sign matrix lattice, see references [2] and [3]. This lattice is the MacNeille completion of the strong Bruhat order on the symmetric group [1], which means it is the smallest lattice containing the Bruhat order as a subposet. This is a distributive lattice, so the rank of each element is given by the cardinality of the associated order ideal. The rank is calculated by summing the entries of the corresponding ''monotone triangle'' and subtracting $\binom{n+2}{3}$, which is the sum of the entries of the monotone triangle corresponding to the identity permutation of $n$. This is also the number of bigrassmannian permutations (that is, permutations with exactly one left descent and one right descent) below a given permutation $\pi$ in Bruhat order, see Theorem 1 of [6].

The rank of the alternating sign matrix in the alternating sign matrix poset. This rank is the sum of the entries of the monotone triangle minus $\binom{n+2}{3}$, which is the smallest sum of the entries in the set of all monotone triangles with bottom row $1\dots n$. Alternatively, $rank(A)=\frac{1}{2} \sum_{i,j=1}^n (i-j)^2 a_{ij}$, see [3, thm.5.1].

The non-inversion sum of a permutation. A pair $a < b$ is an noninversion of a permutation $\pi$ if $\pi(a) < \pi(b)$. The non-inversion sum is given by $\sum(b-a)$ over all non-inversions of $\pi$.

The atomic length of a signed permutation. The atomic length of an element $w$ of a Weyl group is the sum of the heights of the inversions of $w$.

The vector space dimension of $Ext_A^1(I_o,A)$ when $I_o$ is the tilting module corresponding to the permutation $o$ in the Auslander algebra $A$ of $K[x]/(x^n)$.

The rank of the poset.

The height of a poset. This equals the rank of the poset [[St000080]] plus one.

The number of maximal antichains in a poset.

The dimension of the reduced incidence algebra of a poset. The reduced incidence algebra of a poset is the subalgebra of the incidence algebra consisting of the elements which assign the same value to any two intervals that are isomorphic to each other as posets. Thus, this statistic returns the number of non-isomorphic intervals of the poset.

The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset.