2010
DOI: 10.37236/435
|View full text |Cite
|
Sign up to set email alerts
|

Cyclic Derangements

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2013
2013
2025
2025

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 18 publications
0
6
0
Order By: Relevance
“…Wreath products and the incomplete gamma function. Assaf introduced a generalization of derangements to wreath products with cyclic groups [3]. Let C r ≀ S n denote the wreath product of the cyclic group of order r with the symmetric group of degree n. This group acts on [r] × [n].…”
Section: Derangements Are a Classical Topic In Combinatoricsmentioning
confidence: 99%
“…Wreath products and the incomplete gamma function. Assaf introduced a generalization of derangements to wreath products with cyclic groups [3]. Let C r ≀ S n denote the wreath product of the cyclic group of order r with the symmetric group of degree n. This group acts on [r] × [n].…”
Section: Derangements Are a Classical Topic In Combinatoricsmentioning
confidence: 99%
“…Let D r n be the set of all colored derangements in S n,r . Faliharimalala and Zeng [25, Equation (2.7)] (see also [6,Theorem 2.1], where colored derangements are called cyclic derangements) proved the following formula…”
Section: 15)mentioning
confidence: 99%
“…Euler-Mahonian identities. Equation (4.2) is Biagioli-Zeng's identity (2.5) and Equation (4.1) appears in Assaf's work[6, Equation (13) for t = 1], where the author uses the length order.…”
mentioning
confidence: 99%
“…, σ n ). We adopt the following total order on the elements of (Z r × [n]) ∪ {0} (see [1,2], for example):…”
Section: 3mentioning
confidence: 99%