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)- On the \(r\)-derangements of type B
- Finite groups of derangements on the \(n\)-cube.
- A group action on derangements
- Matrix representations for a certain class of combinatorial numbers associated with Bernstein basis functions and cyclic derangements and their probabilistic and asymptotic analyses
- Specializations of colored quasisymmetric functions
- A combinatorial approach to derangement matrix of type \(B\)
- Cyclic derangement polynomials of the wreath product \(\mathcal{C}_r\wr S_n\)
- scientific article; zbMATH DE number 4173894 (Why is no real title available?)
- Derangements and the 𝑝-adic incomplete gamma function
- Cyclic Inclusion-Exclusion
- Specializations of colored quasisymmetric functions and Euler-Mahonian identities
- Counting derangements, involutions and unimodal elements in the wreath product \(C_r\wr\mathfrak S_n\)
- Moving faces to other places: facet derangements
- Top to random shuffles on colored permutations
- Signed Mahonian polynomials on derangements in classical Weyl groups
- On the adjacent cycle derangements
- Derangements and the \(p\)-adic incomplete gamma function
- Cyclic permutations realized by signed shifts
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)
