| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6424278 | European Journal of Combinatorics | 2012 | 12 Pages |
Abstract
We give simple combinatorial proofs of some formulas for the number of factorizations of permutations in Sn as a product of two n-cycles, or of an n-cycle and an (nâ1)-cycle.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Robert Cori, Michel Marcus, Gilles Schaeffer,