Bijections and symmetries for the factorizations of the long cycle

We study the factorizations of the permutation $(1,2,\ldots,n)$ into $k$ factors of given cycle types. Using representation theory, Jackson obtained for each $k$ an elegant formula for counting these factorizations according to the number of cycles of each factor. In the cases $k=2,3$ Schaeffer and Vassilieva gave a combinatorial proof of Jackson's formula, and Morales and Vassilieva obtained more refined formulas exhibiting a surprising symmetry property. These counting results are indicative of a rich combinatorial theory which has remained elusive to this point, and it is the goal of this article to establish a series of bijections which unveil some of the combinatorial properties of the factorizations of $(1,2,\ldots,n)$ into $k$ factors for all $k$. We thereby obtain refinements of Jackson's formulas which extend the cases $k=2,3$ treated by Morales and Vassilieva. Our bijections are described in terms of ''constellations'', which are graphs embedded in surfaces encoding the transitive factorizations of permutations.

Data and Resources

Additional Info

Field Value
Source ISSN: 0196-8858
Author Bernardi, Olivier, Morales, Alejandro, H.
Maintainer CCSD
Last Updated November 10, 2026, 10:11 (UTC)
Created November 10, 2026, 10:11 (UTC)
Identifier hal-00653670
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Massachusetts Institute of Technology (MIT)
creator Bernardi, Olivier
date 2013-11-10T00:00:00
harvest_object_id 54c4a90e-9ea2-4a3e-83c6-406b3621f66a
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2024-04-08T00:00:00
relation info:eu-repo/semantics/altIdentifier/arxiv/1112.4970
set_spec type:ART