Odd permutations are nicer than even ones
From MaRDI portal
Publication:444404
DOI10.1016/J.EJC.2012.03.012zbMATH Open1244.05007OpenAlexW1975238241WikidataQ114184816 ScholiaQ114184816MaRDI QIDQ444404FDOQ444404
Authors: Robert Cori, Michel Marcus, Gilles Schaeffer 
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
Recommendations
- Factorizations of an \(n\)-cycle into two \(n\)-cycles
- Sur les représentations des permutations impaires. (On the representations of odd permutations)
- Some combinatorial properties of the alternating group.
- Short factorizations of permutations into transpositions
- A representation of even permutations
Cites Work
- Some Remarks on Commutators
- Factoring \(n\)-cycles and counting maps of given genus
- Nombre de factorisations d'un grand cycle (Number of factorizations of a large cycle)
- Factorizations of large cycles in the symmetric group
- 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
- Factorizations of an \(n\)-cycle into two \(n\)-cycles
- 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
- Linear coefficients of Kerov's polynomials: bijective proof and refinement of Zagier's result
- Title not available (Why is that?)
Cited In (12)
- Random 2-cell embeddings of multistars
- A note on the total number of cycles of even and odd permutations
- Separation probabilities for products of permutations
- The Harer-Zagier and Jackson formulas and new results for one-face bipartite maps
- Simple permutations mix even better
- A versatile combinatorial approach of studying products of long cycles in symmetric groups
- On products of long cycles: short cycle dependence and separation probabilities
- Factorizations of an \(n\)-cycle into two \(n\)-cycles
- Short factorizations of permutations into transpositions
- Combinatorially refine a Zagier-Stanley result on products of permutations
- Breaking cycles, the odd versus the even
- Plane permutations and applications to a result of Zagier-Stanley and distances of permutations
This page was built for publication: Odd permutations are nicer than even ones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q444404)
