Cyclic derangements

From MaRDI portal
Publication:612949

zbMATH Open1204.05012arXiv1002.3138MaRDI QIDQ612949FDOQ612949


Authors: Sami Assaf Edit this on Wikidata


Publication date: 16 December 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1002.3138

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (18)





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)