Ekaterina A. Vassilieva - Long Cycle Factorizations: Bijective Computation in the General Case

dmtcs:2367 - Discrete Mathematics & Theoretical Computer Science, January 1, 2013, DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013) - https://doi.org/10.46298/dmtcs.2367
Long Cycle Factorizations: Bijective Computation in the General CaseArticle

Authors: Ekaterina A. Vassilieva 1

  • 1 Laboratoire d'informatique de l'École polytechnique [Palaiseau]

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.

https://doi.org/10.46298/dmtcs.2367
Source: HAL:hal-01229679v1
Volume: DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013)
Section: Proceedings
Published on: January 1, 2013
Imported on: November 21, 2016
Keywords: Jackson's formula,factorizations,symmetric group,connection coefficients,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
Funding:
    Source : OpenAIRE Graph
  • Combinatorial methods, from enumerative topology to random discrete structures and compact data representations.; Funder: European Commission; Code: 208471

1 Document citing this article

Share and export

Consultation statistics

This page has been seen 179 times.
This article's PDF has been downloaded 415 times.