Character-theoretic techniques for near-central enumerative problems

DOI10.1016/J.JCTA.2012.05.004zbMATH Open1246.05172arXiv1108.4045OpenAlexW2001861700MaRDI QIDQ444904FDOQ444904

Authors: David M. Jackson, Craig A. Sloss 

Publication date: 24 August 2012

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

Abstract: The centre of the symmetric group algebra $mathbbC[mathfrak{S}_n]$ has been used successfully for studying important problems in enumerative combinatorics. These include maps in orientable surfaces and ramified covers of the sphere by curves of genus $g$, for example. However, the combinatorics of some equally important $mathfrak{S}_n$-factorization problems forces $k$ elements in $1,\mathrm{...},n$ to be distinguished. Examples of such problems include the star factorization problem, for which $k=1,$ and the enumeration of 2-cell embeddings of dipoles with two distinguished edges cite{VisentinWieler:2007} associated with Berenstein-Maldacena-Nastase operators in Yang-Mills theory cite{ConstableFreedmanHeadrick:2002}, for which $k=2.$ Although distinguishing these elements obstructs the use of central methods, these problems may be encoded algebraically in the centralizer of $mathbbC[mathfrak{S}_n]$ with respect to the subgroup $mathfrak{S}_{n-k}.$ We develop methods for studying these problems for $k=1,$ and demonstrate their efficacy on the star factorization problem. In a subsequent paper cite{JacksonSloss:2011}, we consider a special case of the the above dipole problem by means of these techniques.

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

Recommendations

• Near-central permutation factorization and Strahov's generalized Murnaghan-Nakayama rule
• Some combinatorial problems associated with products of conjugacy classes of the symmetric group
• Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
• Transitive powers of Young-Jucys-Murphy elements are central.
• Stanley's character polynomials and coloured factorisations in the symmetric group

zbMATH Keywords

centralizers of the symmetric group algebrageneralized charactersjucysMurphy elementsstar factorizations

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Symmetric groups (20B30)

Cites Work

• Title not available (Why is that?)
• Transitive powers of Young-Jucys-Murphy elements are central.
• Title not available (Why is that?)
• Transitive factorisations into transpositions and holomorphic mappings on the sphere
• A new approach to representation theory of symmetric groups
• Towards the geometry of double Hurwitz numbers
• Random shuffles and group representations
• Title not available (Why is that?)
• Generalized characters of the symmetric group.
• Symmetric polynomials and the center of the symmetric group ring
• Title not available (Why is that?)
• Seminormal Representations of Weyl Groups and Iwahori-Hecke Algebras
• Minimal factorizations of permutations into star transpositions
• Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and \(k\)-ary trees
• A Character Theoretic Approach to Embeddings of Rooted Maps in an Orientable Surface of Given Genus
• Vertex operators and the class algebras of symmetric groups.
• Title not available (Why is that?)
• Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
• Near-central permutation factorization and Strahov's generalized Murnaghan-Nakayama rule
• On the genus distribution of \((p,q,n)\)-dipoles

Cited In (5)

• Near-central permutation factorization and Strahov's generalized Murnaghan-Nakayama rule
• A general framework for the polynomiality property of the structure coefficients of double-class algebras
• Title not available (Why is that?)
• Target Enumeration via Euler Characteristic Integrals
• A characteristic-free example of a Lascoux resolution, and letter-place methods for intertwining numbers.

This page was built for publication: Character-theoretic techniques for near-central enumerative problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q444904)