Odd permutations are nicer than even ones - Laboratoire d'informatique de l'école polytechnique Accéder directement au contenu
Article Dans Une Revue European Journal of Combinatorics Année : 2012

Odd permutations are nicer than even ones

Résumé

We give simple combinatorial proofs of some formulas for the number of factorizations of permutations in S n as a product of two n-cycles, or of an n-cycle and an (n−1)-cycle. ... The parameter number of cycles plays a central role in the algebraic theory of the symmetric group, however there are very few results giving a relationship between the number of cycles of two permutations and that of their product. ... The first results on the subject go back to Ore, Bertram, Stanley (see [13], [1] and [15]), who proved some existence theorems. These results allowed to obtain ...
Fichier principal
Vignette du fichier
coriMarcusSchaeffer.pdf (183.37 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00977351 , version 1 (11-04-2014)

Identifiants

  • HAL Id : hal-00977351 , version 1

Citer

Robert Cori, Michel Marcus, Gilles Schaeffer. Odd permutations are nicer than even ones. European Journal of Combinatorics, 2012, 33 (7), pp.1467-1478. ⟨hal-00977351⟩
130 Consultations
413 Téléchargements

Partager

Gmail Facebook X LinkedIn More