Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
research
oaioai:dspace.mit.edu:1721.1/89793

Cyclic Derangements

Authors
Publication date
1 April 2010
Publisher
'The Electronic Journal of Combinatorics'

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 Gessel, Brenti and Chow.National Science Foundation (U.S.) (Mathematical Sciences Postdoctoral Research Fellowship DMS-0703567

Similar works

Full text

thumbnail-image

This paper was published in DSpace@MIT.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.