Nombre de factorisations d'un grand cycle

Simple item page
dc.creatorBiane, Philippe
dc.date2003-07-10
dc.date.accessioned2026-07-07T04:59:35Z
dc.date.available2026-07-07T04:59:35Z
dc.descriptionWe 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.
dc.description3 pages; in French
dc.identifierhttps://arxiv.org/abs/math/0307147
dc.identifierhttp://arxiv.org/abs/math/0307147
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/68044
dc.subjectCombinatorics
dc.subjectGroup Theory
dc.subject05A15; 05E05; 20B30
dc.titleNombre de factorisations d'un grand cycle
dc.typetext

Files

Collections

arXiv