English

Hook restriction coefficients

Combinatorics 2025-12-18 v2 Representation Theory

Abstract

The permutation matrices form a subgroup of GLn(C)\text{GL}_n(\mathbb{C}) that is isomorphic to the symmetric group SnS_n. Let rμλr_{\mu\lambda} denote the multiplicity of the irreducible representation VμV_\mu of SnS_n, corresponding to a partition μ\mu of nn, in the restriction of an irreducible polynomial representation Wλ(C)W_\lambda(\mathbb{C}) of GLn(C)\text{GL}_n(\mathbb{C}), corresponding to a partition λ\lambda with at most nn parts. Finding a combinatorial interpretation for rμλr_{\mu\lambda} remains an open problem in algebraic combinatorics, called the \emph{restriction problem}. We derive a new nonrecursive expression for a character polynomial called the \emph{Specht polynomial} and use it to find a combinatorial interpretation of rμλr_{\mu\lambda} when λ\lambda is a hook-shaped partition.

Keywords

Cite

@article{arxiv.2403.03443,
  title  = {Hook restriction coefficients},
  author = {Sridhar P. Narayanan},
  journal= {arXiv preprint arXiv:2403.03443},
  year   = {2025}
}

Comments

12 pages, 5 figures

R2 v1 2026-06-28T15:10:34.383Z