Annular noncrossing permutations and minimal transitive factorizations
Combinatorics
2022-03-22 v2
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 .
Keywords
Cite
@article{arxiv.1201.5703,
title = {Annular noncrossing permutations and minimal transitive factorizations},
author = {Jang Soo Kim and Seunghyun Seo and Heesung Shin},
journal= {arXiv preprint arXiv:1201.5703},
year = {2022}
}
Comments
13 pages, 3 Figures