Abstract: A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we generalize this problem to enumerating derangements in the wreath product of any finite cyclic group with the symmetric group. We also give q- and (q, t)-analogs for cyclic derangements, generalizing results of Brenti and Gessel.
Recommendations
Cited in
(18)- Cyclic Inclusion-Exclusion
- On the adjacent cycle derangements
- Cyclic derangement polynomials of the wreath product \(\mathcal{C}_r\wr S_n\)
- Top to random shuffles on colored permutations
- Signed Mahonian polynomials on derangements in classical Weyl groups
- scientific article; zbMATH DE number 4173894 (Why is no real title available?)
- Cyclic permutations realized by signed shifts
- A group action on derangements
- Derangements and the 𝑝-adic incomplete gamma function
- Specializations of colored quasisymmetric functions and Euler-Mahonian identities
- Derangements and the \(p\)-adic incomplete gamma function
- Moving faces to other places: facet derangements
- Counting derangements, involutions and unimodal elements in the wreath product \(C_r\wr\mathfrak S_n\)
- Specializations of colored quasisymmetric functions
- On the \(r\)-derangements of type B
- Finite groups of derangements on the \(n\)-cube.
- Matrix representations for a certain class of combinatorial numbers associated with Bernstein basis functions and cyclic derangements and their probabilistic and asymptotic analyses
- A combinatorial approach to derangement matrix of type \(B\)
This page was built for publication: Cyclic derangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q612949)
