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.
| Original language | English |
|---|---|
| Pages (from-to) | 673-682 |
| Number of pages | 10 |
| Journal | Discrete Mathematics and Theoretical Computer Science |
| State | Published - 2012 |
| Externally published | Yes |
| Event | 24th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2012 - Nagoya, Japan Duration: 30 Jul 2012 → 3 Aug 2012 |
Keywords
- Annular noncrossing partitions
- Bijective proof
- Minimal transitive factorizations