arXiv · math/0510362
On the Number of Factorizations of a Full Cycle
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 work of Biane. We deduce from our result a formula of Poulalhon and Schaeffer that was previously derived through an intricate combinatorial argument.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
John Irving. 2005-10-17. On the Number of Factorizations of a Full Cycle. https://searcharxiv.com/abs/math/0510362
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.