Odd permutations are nicer than even ones

Robert Cori, Michel Marcus, Gilles Schaeffer

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)1467-1478
Number of pages12
JournalEuropean Journal of Combinatorics
Volume33
Issue number7
DOIs
Publication statusPublished - 1 Oct 2012

Fingerprint

Dive into the research topics of 'Odd permutations are nicer than even ones'. Together they form a unique fingerprint.

Cite this