On the Number of Factorizations of a Full Cycle

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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.
5 pages, 0 figures

Keywords

Combinatorics, 05A05; 20B30

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/103701

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0510362
 http://arxiv.org/abs/math/0510362
 J. Combin. Theory Ser A., 113 (2006), 1549-1554

Collections

arXiv