On the dual complexity and spectra of some combinatorial functions (Q1661546)

Given a combinatorially interesting function (statistic) \(\alpha\) on the symmetric group \(S_n\) one may construct the element of the group algebra \(a=\sum \alpha(\sigma)\sigma\) and the linear transformation from the group algebra to itself given by multiplication by \(a\). \textit{A. M. Vershik} and \textit{N. V. Tsilevich} [Funct. Anal. Appl. 51, No. 1, 22--31 (2017; Zbl 1369.20013); translation from Funkts. Anal. Prilozh. 51, No. 1, 28--39 (2017)] stated the problems of computing the dimension of the image (dual complexity number) and the eigenvalues (spectra) of these maps, and solved it for the cases in which \(\alpha\) is the descent number, the major index, and the inversion number. In the current paper, the author continues this line of research to the cases in which \(\alpha(\sigma)\) is the number of peaks, valleys, double ascents, double descents, excedance number and number of fixed points of \(\sigma\).