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 pro...
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | 文件 |
| 语言: | en_US |
| 出版: |
Electronic Journal of Combinatorics
2014
|
| 在线阅读: | http://hdl.handle.net/1721.1/89793 |