For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between $e_i J$ and $e_j J$ (the radical of the indecomposable projective modules). The statistic gives half of the rank of the matrix C^t-C.

The Elizalde-Pak rank of a permutation. This is the largest $k$ such that $\pi(i) > k$ for all $i\leq k$. According to [1], the length of the longest increasing subsequence in a $321$-avoiding permutation is equidistributed with the rank of a $132$-avoiding permutation.

The number of deficiencies of a permutation. This is defined as $$\operatorname{dec}(\sigma)=\#\{i:\sigma(i) < i\}.$$ The number of exceedances is [[St000155]].

The number of cycle peaks and the number of cycle valleys of a permutation. A '''cycle peak''' of a permutation $\pi$ is an index $i$ such that $\pi^{-1}(i) < i > \pi(i)$. Analogously, a '''cycle valley''' is an index $i$ such that $\pi^{-1}(i) > i < \pi(i)$. Clearly, every cycle of $\pi$ contains as many peaks as valleys.

The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation.

The number of visible descents of a permutation. A visible descent of a permutation $\pi$ is a position $i$ such that $\pi(i+1) \leq \min(i, \pi(i))$.

The number of descents of a permutation. This can be described as an occurrence of the vincular mesh pattern ([2,1], {(1,0),(1,1),(1,2)}), i.e., the middle column is shaded, see [3].

The number of left outer peaks of a permutation. A left outer peak in a permutation $w = [w_1,..., w_n]$ is either a position $i$ such that $w_{i-1} < w_i > w_{i+1}$ or $1$ if $w_1 > w_2$. In other words, it is a peak in the word $[0,w_1,..., w_n]$. This appears in [1, def.3.1]. The joint distribution with [[St000366]] is studied in [3], where left outer peaks are called ''exterior peaks''.

The number of exceedances (also excedences) of a permutation. This is defined as $exc(\sigma) = \#\{ i : \sigma(i) > i \}$. It is known that the number of exceedances is equidistributed with the number of descents, and that the bistatistic $(exc,den)$ is [[Permutations/Descents-Major#Euler-Mahonian_statistics|Euler-Mahonian]]. Here, $den$ is the Denert index of a permutation, see [[St000156]].

The number of isolated descents of a permutation. A descent $i$ is isolated if neither $i+1$ nor $i-1$ are descents. If a permutation has only isolated descents, then it is called primitive in [1].