Annular noncrossing permutations and minimal transitive factorizations

Kim, Jang Soo; Seo, Seunghyun; Shin, Heesung

doi:10.1016/j.jcta.2014.02.005

상세 보기

Annular noncrossing permutations and minimal transitive factorizations

Kim, Jang Soo;
Seo, Seunghyun;
Shin, Heesung

Citations

WEB OF SCIENCE

2

Citations

SCOPUS

2

초록

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. (C) 2014 Elsevier Inc. All rights reserved.

키워드

Minimal transitive factorization; Annular noncrossing permutation; Combinatorial proof

제목: Annular noncrossing permutations and minimal transitive factorizations

저자: Kim, Jang Soo; Seo, Seunghyun; Shin, Heesung

DOI: 10.1016/j.jcta.2014.02.005

발행일: 2014-05

유형: Article

저널명: Journal of Combinatorial Theory - Series A

권: 124

페이지: 251 ~ 262