Permutations with ascending and descending blocks (Q2380446)

Summary: We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of \textit{I. M. Gessel} and \textit{C. Reutenauer} [J. Comb. Theory, Ser. A 64, No. 2, 189--215 (1993; Zbl 0793.05004)] to deal with permutations that have some ascending and some descending blocks. We then provide the first bijective proofs of some known results. We also extend the work done in [Electron. J. Comb. 16, No. 1, Research Paper R32, 19 p. (2009; Zbl 1181.05003)] by \textit{N. Eriksen}, \textit{R. Freij} and \textit{J. Wästlund}, who study derangements that descend in blocks of prescribed lengths. In particular, we solve some problems posed in [loc. cit.] and also obtain a new combinatorial sum for counting derangements with ascending and descending blocks.