| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656550 | Journal of Combinatorial Theory, Series A | 2006 | 6 Pages |
Abstract
We give a new expression for the number of factorizations of a full cycle into an ordered product of permutations of specified cycle types. This is done through purely algebraic means, extending recent work of Biane. We deduce from our result a remarkable formula of Poulalhon and Schaeffer that was previously derived through an intricate combinatorial argument.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
