Cyclic Derangements

Author(s)
Assaf, Sami H.
Thumbnail
DownloadAssaf-2010-Cyclic derangements.pdf (165.4Kb)
PUBLISHER_POLICY
Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
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 Gessel, Brenti and Chow.
Date issued
2010-12
URI
http://hdl.handle.net/1721.1/89793
Department
Massachusetts Institute of Technology. Department of Mathematics
Journal
Electronic Journal of Combinatorics
Publisher
Electronic Journal of Combinatorics
Citation
Assaf, Sami H. "Cyclic Derangements." Electronic Journal of Combinatorics, Volume 17 (2010).
Version: Final published version
ISSN
1077-8926
Collections