Mathematics – Combinatorics
Scientific paper
2010-02-16
Mathematics
Combinatorics
14 pages
Scientific paper
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.
No associations
LandOfFree
Cyclic derangements does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Cyclic derangements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cyclic derangements will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-51101