The permutation enumeration of wreath products C_k S_n of cyclic and symmetric groups
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.
- A combinatorial interpretation of the inverse kostka matrix
- Brick tabloids and the connection matrices between bases of symmetric functions
- Cycle type and descent set in wreath products
- scientific article; zbMATH DE number 3766017 (Why is no real title available?)
- Permutation enumeration of the symmetric group and the combinatorics of symmetric functions
- Permutation enumeration symmetric functions, and unimodality
- Sequences and inversions
- Labeled partitions with colored permutations
- The combinatorics of symmetric functions and permutation enumeration of the hyperoctahedral group
- Cycle type and descent set in wreath products
- Generalized pattern-matching conditions for C_k S_n
- Generalized pattern avoidance condition for the wreath product of cyclic groups with symmetric groups
- \(k\)-partial permutations and the center of the wreath product \(\mathcal{S}_k\wr\mathcal{S}_n\) algebra
- A polyhedral proof of a wreath product identity
- p-rook numbers and cycle counting in C_p S_n
- Enumerating wreath products via Garsia-Gessel bijections
- Flag weak order on wreath products
- Enumeration of \(m\)-tuples of permutations and a new class of power bases for the space of symmetric functions
- Generating functions for statistics on \(C_k\wr S_n\)
- The numbers of permutation groups orbits and of the wreath product orbits
- Lecture hall partitions and the wreath products \(C_{k} \wr S_{n}\)
- Edgewise subdivisions, local \(h\)-polynomials, and excedances in the wreath product \(\mathbb{Z}_r \wr \mathfrak{S}_n\)
- scientific article; zbMATH DE number 4158945 (Why is no real title available?)
- scientific article; zbMATH DE number 5773278 (Why is no real title available?)
- Consecutive up-down patterns in up-down permutations
- scientific article; zbMATH DE number 781328 (Why is no real title available?)
- Generating functions for monomial characters of wreath products ℤ/dℤ≀ 𝕾_n
- Fix-Euler-Mahonian statistics on wreath products
- A Carlitz identity for the wreath product \(C_r \wr \mathcal G_n\)
- Counting derangements, involutions and unimodal elements in the wreath product \(C_r\wr\mathfrak S_n\)
- Euler-Mahonian polynomials for \(C_{a}\wr S_{n}\)
This page was built for publication: The permutation enumeration of wreath products \(C_{k}\wr S_{n}\) of cyclic and symmetric groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1398307)
