Abstract
We give simple combinatorial proofs of some formulas for the number of factorizations of permutations in Snas a product of two n-cycles, or of an n-cycle and an (n-1)-cycle.
| Original language | English |
|---|---|
| Pages (from-to) | 1467-1478 |
| Number of pages | 12 |
| Journal | European Journal of Combinatorics |
| Volume | 33 |
| Issue number | 7 |
| DOIs | |
| Publication status | Published - 1 Oct 2012 |