Cyclic Derangements
Name
Assaf-2010-Cyclic derangements.pdf
Size
165.45 KB
Format
Adobe PDF
Checksum (MD5)
11daebe5c02b958d5ab9c5a942951bbb
Author(s)
Assaf, Sami H.
Date Issued
December 2010
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
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.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
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.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.37236/435
