media archive
Computational sciences Conferences KIAS Workshop on Combinatorics
Loading the player ...
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
Keyword  |  
Download  |  
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).
  • On Combinatorial pro...
    Younjin Kim
    June 1(Sat), 2013
  • Flag enumeration of ...
    Sangwook Kim
    June 1(Sat), 2013
  • Classi?cation of reg...
    Youngsoo Kwon
    May 31(Fri), 2013
  • Zeta functions of ad...
    Mitsugu Hirasaka
    May 31(Fri), 2013
  • Fractional weak disc...
    Jeong Ok Choi
    May 31(Fri), 2013
  • Balanced labellings ...
    Hwanchul Yoo
    May 31(Fri), 2013
  • Colored permutations...
    Seunghyun Seo
    May 31(Fri), 2013
  • The Riordan group an...
    Gi-Sang Cheon
    May 30(Thu), 2013
  • Polytope numbers and...
    Hyun Kwang Kim
    May 30(Thu), 2013
  • Coloring of the squa...
    Seog-Jin Kim
    May 30(Thu), 2013