17,147 research outputs found
Some identities on derangement and degenerate derangement polynomials
In combinatorics, a derangement is a permutation that has no fixed points.
The number of derangements of an n-element set is called the n-th derangement
number. In this paper, as natural companions to derangement numbers and
degenerate versions of the companions we introduce derangement polynomials and
degenerate derangement polynomials. We give some of their properties,
recurrence relations and identities for those polynomials which are related to
some special numbers and polynomials.Comment: 12 page
Cyclic derangements
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.Comment: 14 page
Efficient generation of random derangements with the expected distribution of cycle lengths
We show how to generate random derangements efficiently by two different
techniques: random restricted transpositions and sequential importance
sampling. The algorithm employing restricted transpositions can also be used to
generate random fixed-point-free involutions only, a.k.a. random perfect
matchings on the complete graph. Our data indicate that the algorithms generate
random samples with the expected distribution of cycle lengths, which we
derive, and for relatively small samples, which can actually be very large in
absolute numbers, we argue that they generate samples indistinguishable from
the uniform distribution. Both algorithms are simple to understand and
implement and possess a performance comparable to or better than those of
currently known methods. Simulations suggest that the mixing time of the
algorithm based on random restricted transpositions (in the total variance
distance with respect to the distribution of cycle lengths) is
with and the length of the
derangement. We prove that the sequential importance sampling algorithm
generates random derangements in time with probability of
failing.Comment: This version corrected and updated; 14 pages, 2 algorithms, 2 tables,
4 figure
A generalization of the "probléme des rencontres"
In this paper, we study a generalization of the classical \emph{probl\'eme des rencontres} (\emph{problem of coincidences}),
consisting in the enumeration of all permutations \pi \in \SS_n with fixed points,
and, in particular, in the enumeration of all permutations \pi \in \SS_n with no fixed points (derangements).
Specifically, we study this problem for the permutations of the
symbols , , \ldots, , , , \ldots, ,
where for every .
In this way, we obtain a generalization of the derangement numbers,
the rencontres numbers and the rencontres polynomials.
For these numbers and polynomials, we obtain the exponential generating series, some recurrences and representations,
and several combinatorial identities. Moreover, we obtain the expectation and the variance
of the number of fixed points in a random permutation of the considered kind.
Finally, we obtain some asymptotic formulas
for the generalized rencontres numbers and the generalized derangement numbers
On the Spectrum of the Derangement Graph
We derive several interesting formulae for the eigenvalues of the derangement graph and use them to settle affirmatively a conjecture of Ku regarding the least eigenvalue
- âŠ