Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4655316 | Journal of Combinatorial Theory, Series A | 2014 | 12 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jang Soo Kim, Seunghyun Seo, Heesung Shin,