On the Number of Factorizations of a Full Cycle
| dc.creator | Irving, John | |
| dc.date | 2005-10-17 | |
| dc.date.accessioned | 2026-07-07T06:47:35Z | |
| dc.date.available | 2026-07-07T06:47:35Z | |
| dc.description | 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. | |
| dc.description | 5 pages, 0 figures | |
| dc.identifier | https://arxiv.org/abs/math/0510362 | |
| dc.identifier | http://arxiv.org/abs/math/0510362 | |
| dc.identifier | J. Combin. Theory Ser A., 113 (2006), 1549-1554 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/103701 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A05; 20B30 | |
| dc.title | On the Number of Factorizations of a Full Cycle | |
| dc.type | text |