Sur les représentations des permutations impaires. (On the representations of odd permutations)

DOI10.1016/S0195-6698(05)80033-2MaRDI QIDQ1197622zbMATH OpenFDO

Authors Antonio Machì

Publication date 16 January 1993

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0195-6698(05)80033-2

zbMATH Keywords

odd permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Review text

A simple combinatorial proof is given of the fact that all odd permutations on \(n\) letters can be represented in \(2(n-2)!\) different ways as a product of a cycle of length \(n\) and a cycle of length \(n-1\). The method of proof provides an algorithm for explicitly constructing all such representations. One can also use the method to construct representations of even permutations on \(n\) letters as a product of two cycles of length \(n\), cf. \textit{D. H. Husemoller} [Ramified coverings of Riemann surfaces, Duke Math. J. 29, 167-174 (1962; Zbl 0196.340)].

Recommendations

• On permutation representations
• scientific article; zbMATH DE number 3929102
• scientific article; zbMATH DE number 3948563
• Permutation representations on Schubert varieties
• scientific article; zbMATH DE number 3104489
• On permutation representations of polyhedral groups
• On the representation of permutations as products of transpositions

Cites work

• Nombre de représentations d'une permutation comme produit de deux cycles de longueurs données
• Ramified coverings of Riemann surfaces

Cited in

(14)

• A representation of even permutations
• Even permutations not representable in the form of a product of two permutations of given order
• Factorizations of an n-cycle into two n-cycles
• On a problem raised by P. J. Cameron
• Permutations as minimal powers of a single-cycle class-sum
• scientific article; zbMATH DE number 3929102 (Why is no real title available?)
• scientific article; zbMATH DE number 4027474 (Why is no real title available?)
• Odd permutations are nicer than even ones
• GENERATING AND COVERING THE ALTERNATING OR SYMMETRIC GROUP
• Cycle decompositions and train tracks
• Realization of even permutations of even degree by products of four involutions without fixed points
• Breaking cycles, the odd versus the even
• On the number of dessins d'enfants with all permutations n-cycles
• A note on the total number of cycles of even and odd permutations

This page was built for publication: Sur les représentations des permutations impaires. (On the representations of odd permutations)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197622)