Cyclic derangements (Q612949)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5827412
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cyclic derangements |
scientific article; zbMATH DE number 5827412 |
Statements
Cyclic derangements (English)
0 references
16 December 2010
0 references
Summary: 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.
0 references
number of dreangements
0 references
permutations
0 references
facet derangement
0 references
wreath product
0 references
cyclic group
0 references
symmetric group
0 references
0 references
