Near-central permutation factorization and Strahov's generalized Murnaghan-Nakayama rule

DOI10.1016/j.jcta.2012.06.006zbMath1246.05173arXiv1108.4047OpenAlexW2013850021MaRDI QIDQ444916

Craig A. Sloss, David M. Jackson

Publication date: 24 August 2012

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.4047

zbMATH Keywords

generalized characterspermutation factorizationcentralizers of the symmetric group algebradipoles in orientable surfaces

Mathematics Subject Classification ID

Related Items (2)

A general framework for the polynomiality property of the structure coefficients of double-class algebras ⋮ Character-theoretic techniques for near-central enumerative problems

Cites Work

• Character-theoretic techniques for near-central enumerative problems
• On the number of factorizations of a full cycle
• On the genus distribution of \((p,q,n)\)-dipoles
• Generalized characters of the symmetric group.
• The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group
• 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
• Towards the geometry of double Hurwitz numbers
• 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
• Transitive factorisations into transpositions and holomorphic mappings on the sphere
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Near-central permutation factorization and Strahov's generalized Murnaghan-Nakayama rule