Annular noncrossing permutations and minimal transitive factorizations
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:35EAGQJBrecord.jsonopen to challenge →
classification
math.CO
keywords
annularfactorizationsgouldenminimalnoncrossingnumberpermutationtransitive
read the original 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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.