상세 보기
Minimal transitive factorizations of a permutation of type (p, q)
- Kim, Jang-soo;
- Seo, Seunghyun;
- Shin, Heesung
Citations
SCOPUS
0초록
We give a combinatorial proof of Goulden and Jackson's formula for the number of minimal transitive factorizations of a permutation when the permutation has two cycles. We use the recent result of Goulden, Nica, and Oancea on the number of maximal chains of annular noncrossing partitions of type B. © 2012 Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France.
키워드
Annular noncrossing partitions; Bijective proof; Minimal transitive factorizations
- 제목
- Minimal transitive factorizations of a permutation of type (p, q)
- 저자
- Kim, Jang-soo; Seo, Seunghyun; Shin, Heesung
- 발행일
- 2012
- 유형
- Conference paper
- 페이지
- 673 ~ 682