Character-theoretic techniques for near-central enumerative problems
From MaRDI portal
Publication:444904
DOI10.1016/j.jcta.2012.05.004zbMath1246.05172arXiv1108.4045OpenAlexW2001861700MaRDI QIDQ444904
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.4045
generalized characterscentralizers of the symmetric group algebrajucysMurphy elementsstar factorizations
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
A general framework for the polynomiality property of the structure coefficients of double-class algebras ⋮ Near-central permutation factorization and Strahov's generalized Murnaghan-Nakayama rule
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Near-central permutation factorization and Strahov's generalized Murnaghan-Nakayama rule
- A new approach to representation theory of symmetric groups
- On the genus distribution of \((p,q,n)\)-dipoles
- Generalized characters of the symmetric group.
- Transitive powers of Young-Jucys-Murphy elements are central.
- Minimal factorizations of permutations into star transpositions
- Random shuffles and group representations
- Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and \(k\)-ary trees
- Vertex operators and the class algebras of symmetric groups.
- Symmetric polynomials and the center of the symmetric group ring
- Towards the geometry of double Hurwitz numbers
- Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
- Seminormal Representations of Weyl Groups and Iwahori-Hecke Algebras
- 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
This page was built for publication: Character-theoretic techniques for near-central enumerative problems