Odd permutations are nicer than even ones

DOI10.1016/j.ejc.2012.03.012zbMath1244.05007OpenAlexW1975238241WikidataQ114184816 ScholiaQ114184816MaRDI QIDQ444404

Michel Marcus, Gilles Schaeffer, Robert Cori

Publication date: 14 August 2012

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

Full work available at URL: https://doi.org/10.1016/j.ejc.2012.03.012

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (6)

Random 2-cell embeddings of multistars ⋮ A versatile combinatorial approach of studying products of long cycles in symmetric groups ⋮ Combinatorially refine a Zagier-Stanley result on products of permutations ⋮ On products of long cycles: short cycle dependence and separation probabilities ⋮ Separation Probabilities for Products of Permutations ⋮ Plane Permutations and Applications to a Result of Zagier--Stanley and Distances of Permutations

Cites Work

• Unnamed Item
• Unnamed Item
• How many ways can a permutation be factored into two n-cycles?
• Nombre de représentations d'une permutation comme produit de deux cycles de longueurs données
• Factorization of permutations into n-cycles
• Sur les représentations des permutations impaires. (On the representations of odd permutations)
• A representation of even permutations
• Factoring \(n\)-cycles and counting maps of given genus
• Factorizations of an \(n\)-cycle into two \(n\)-cycles
• Nombre de factorisations d'un grand cycle (Number of factorizations of a large cycle)
• Factorizations of large cycles in the symmetric group
• Two enumerative results on cycles of permutations
• Even permutations as a product of two conjugate cycles
• Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
• Some Remarks on Commutators

This page was built for publication: Odd permutations are nicer than even ones