 |
Discrete Mathematics & Theoretical Computer Science |
Jang Soo Kim ; Seunghyun Seo ; Heesung Shin - Minimal transitive factorizations of a permutation of type (p,q)
dmtcs:3073 - Discrete Mathematics & Theoretical Computer Science, January 1, 2012, DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012) - https://doi.org/10.46298/dmtcs.3073Minimal transitive factorizations of a permutation of type (p,q)Article
- 1 University of Minnesota [Twin Cities]
- 2 Department of Math Education [Chuncheon]
- 3 Department of Mathematics [Incheon]
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.
Source: HAL:hal-01283099v1
Volume: DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)
Section: Proceedings
Published on: January 1, 2012
Imported on: January 31, 2017
Keywords: minimal transitive factorizations, annular noncrossing partitions, bijective proof,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
Consultation statistics
This page has been seen 292 times.
This article's PDF has been downloaded 433 times.