The permutation enumeration of wreath products \(C_{k}\wr S_{n}\) of cyclic and symmetric groups (Q1398307)

Brenti introduced a homomorphism defined on the elementary symmetric functions, which when applied to the homogeneous symmetric functions yields the generating function for the number of descents of a permutation (the Eulerian polynomial). In addition, when applied to the power sum symmetric functions this homomorphism yields the generating function for the number of excedences over conjugacy classes. Beck and Remmel extended these results to the hyperoctahedral group, and in this paper the natural extension to the wreath product of a cyclic group with a symmetric group is investigated. It begins by defining descents and inversions for the aforementioned wreath products in a natural way. From here we see the wreath product analogue of the homomorphism when applied to the analogue of the homogeneous symmetric functions yields results involving wreath descents and inversions, whilst when applied to the analogue of the power sum symmetric functions yields results involving wreath descendances. The investigation of other bases produces similar but more complex results. Finally, the paper concludes with analogous results for orderings other than the one already in use, which are stated without proof.