Nombre de factorisations d'un grand cycle
组合数学
2007-05-23 v1 群论
摘要
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.
引用
@article{arxiv.math/0307147,
title = {Nombre de factorisations d'un grand cycle},
author = {Philippe Biane},
journal= {arXiv preprint arXiv:math/0307147},
year = {2007}
}
备注
3 pages; in French