Annular noncrossing permutations and minimal transitive factorizations

Abstract

We give two combinatorial proofs 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$.

arXiv comment13 pages, 3 Figures

Cited by in corpus (2)

• Reflected entropy in random tensor networks
• Counting non-crossing permutations on surfaces of any genus