Show simple item record

dc.contributor.authorAssaf, Sami H.
dc.date.accessioned2014-09-17T16:09:40Z
dc.date.available2014-09-17T16:09:40Z
dc.date.issued2010-12
dc.date.submitted2010-04
dc.identifier.issn1077-8926
dc.identifier.urihttp://hdl.handle.net/1721.1/89793
dc.description.abstractA 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.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Mathematical Sciences Postdoctoral Research Fellowship DMS-0703567)en_US
dc.language.isoen_US
dc.publisherElectronic Journal of Combinatoricsen_US
dc.relation.isversionofhttp://www.combinatorics.org/ojs/index.php/eljc/article/view/v17i1r163en_US
dc.rightsArticle 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.en_US
dc.sourceElectronic Journal of Combinatoricsen_US
dc.titleCyclic Derangementsen_US
dc.typeArticleen_US
dc.identifier.citationAssaf, Sami H. "Cyclic Derangements." Electronic Journal of Combinatorics, Volume 17 (2010).en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematicsen_US
dc.contributor.mitauthorAssaf, Sami H.en_US
dc.relation.journalElectronic Journal of Combinatoricsen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsAssaf, Sami H.en_US
mit.licensePUBLISHER_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record