Enumeration of type \(D\) permutations with alternating runs (Q722498)

Following the work of \textit{C.-O. Chow} and \textit{S.-M. Ma} [Discrete Math. 323, 49--57 (2014; Zbl 1283.05014)], the authors of this paper study the enumeration of type D permutations with alternating runs. They obtain several results such as establishing a recurrence for the generating function of alternating runs and an identity on alternating runs of type D permutations. Note that the even signed permutations of rank \(n\) is called a Coxeter group of type D.