KIAS Workshop on Combinatorics
Colored permutations and generalizations of derangements
SPEAKER | Seunghyun Seo
INSTITUTE | Kangwon National University
DATE | May 31(Fri), 2013
TIME | 00:00
PLACE | Conference room 1503, KIAS
ABSTRACT | A derangement is a permutation without any ?xed points. There are several generalizations of derangements in the literature. In this talk, we introduce 5 types of colored permutations which are all generalizations of derangements. We present the generating function of each type and ?nd the hierarchy of them combinatorially. We also present bijective proofs among the objects. This is joint work with Dongsu Kim(NIMS) and Jang Soo Kim(KIAS).