Skip to Main content Skip to Navigation
Conference papers

Long Cycle Factorizations: Bijective Computation in the General Case

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.
Document type :
Conference papers
Complete list of metadata
Contributor : Alain Monteil Connect in order to contact the contributor
Submitted on : Tuesday, November 17, 2015 - 10:19:48 AM
Last modification on : Thursday, March 5, 2020 - 6:31:21 PM
Long-term archiving on: : Thursday, February 18, 2016 - 11:36:47 AM


Publisher files allowed on an open archive




Ekaterina A. Vassilieva. Long Cycle Factorizations: Bijective Computation in the General Case. 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. pp.1077-1088, ⟨10.46298/dmtcs.2367⟩. ⟨hal-01229679⟩



Record views


Files downloads