paper

Nombre de factorisations d'un grand cycle

arXiv:math/0307147

Abstract

We give a short proof, based on symmetric function theory, of a formula due to Goupil and Schaeffer, counting the number of factorizations of a cycle of maximal length in the symmetric group, into the product of two permutations of given conjugacy classes.

3 pages; in French

Nombre de factorisations d'un grand cycle · wovepaper