Cyclic derangements
The electronic journal of combinatorics, Tome 17 (2010)
Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website
Zbl arXiv EuDML
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.
DOI :
10.37236/435
Classification :
05A15, 05A05, 05A30
Mots-clés : number of dreangements, permutations, facet derangement, wreath product, cyclic group, symmetric group
Mots-clés : number of dreangements, permutations, facet derangement, wreath product, cyclic group, symmetric group
Sami H. Assaf. Cyclic derangements. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/435
@article{10_37236_435,
author = {Sami H. Assaf},
title = {Cyclic derangements},
journal = {The electronic journal of combinatorics},
year = {2010},
volume = {17},
doi = {10.37236/435},
zbl = {1204.05012},
url = {http://geodesic.mathdoc.fr/articles/10.37236/435/}
}
Cité par Sources :