Abstract
This paper is devoted to the computation of the number of ordered factorizations of a long cycle in the symmetric group where the number of factors is arbitrary and the cycle structure of the factors is given. Jackson (1988) derived the first closed form expression for the generating series of these numbers using the theory of the irreducible characters of the symmetric group. Thanks to a direct bijection we compute a similar formula and provide the first purely combinatorial evaluation of these generating series.
| Original language | English |
|---|---|
| Pages (from-to) | 1077-1088 |
| Number of pages | 12 |
| Journal | Discrete Mathematics and Theoretical Computer Science |
| Publication status | Published - 18 Nov 2013 |
| Event | 25th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2013 - Paris, France Duration: 24 Jun 2013 → 28 Jun 2013 |
Keywords
- Connection coefficients
- Factorizations
- Jackson's formula
- Symmetric group
Fingerprint
Dive into the research topics of 'Long cycle factorizations: Bijective computation in the general case'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver