On products of long cycles: short cycle dependence and separation probabilities
From MaRDI portal
Publication:894246
DOI10.1007/s10801-014-0578-6zbMath1326.05171arXiv1211.6630OpenAlexW2068711047MaRDI QIDQ894246
Valentin Féray, Amarpreet Rattan
Publication date: 30 November 2015
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.6630
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
A versatile combinatorial approach of studying products of long cycles in symmetric groups ⋮ On products of permutations with the most uncontaminated cycles by designated labels
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Odd permutations are nicer than even ones
- Bijective enumeration of some colored permutations given by the product of two long cycles
- 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
- The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group
- Factoring \(n\)-cycles and counting maps of given genus
- Two enumerative results on cycles of permutations
- The centres of symmetric group rings
- Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
- A Character Theoretic Approach to Embeddings of Rooted Maps in an Orientable Surface of Given Genus
- Separation Probabilities for Products of Permutations
This page was built for publication: On products of long cycles: short cycle dependence and separation probabilities
