Nombre de factorisations d'un grand cycle

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

Cited by in corpus (5)

• Explicit monomial expansions of the generating series for connection coefficients
• Two Enumerative Results on Cycles of Permutations
• Moments of normally distributed random matrices - Bijective explicit evaluation
• Near-central Permutation Factorization and Strahov's Generalized Murnaghan-Nakayama Rule
• On the Number of Factorizations of a Full Cycle