English

Kostka multiplicity one for multipartitions

Combinatorics 2015-07-10 v2 Representation Theory

Abstract

If [λ(j)][\lambda(j)] is a multipartition of the positive integer nn (a sequence of partitions with total size nn), and μ\mu is a partition of nn, we study the number K[λ(j)]μK_{[\lambda(j)]\mu} of sequences of semistandard Young tableaux of shape [λ(j)][\lambda(j)] and total weight μ\mu. We show that the numbers K[λ(j)]μK_{[\lambda(j)] \mu} occur naturally as the multiplicities in certain permutation representations of wreath products. The main result is a set of conditions on [λ(j)][\lambda(j)] and μ\mu which are equivalent to K[λ(j)]μ=1K_{[\lambda(j)] \mu} = 1, generalizing a theorem of Berenshte\u{\i}n and Zelevinski\u{\i}. We also show that the questions of whether K[λ(j)]μ>0K_{[\lambda(j)] \mu} > 0 or K[λ(j)]μ=1K_{[\lambda(j)] \mu} = 1 can be answered in polynomial time, expanding on a result of Narayanan. Finally, we give an application to multiplicities in the degenerate Gel'fand-Graev representations of the finite general linear group, and we show that the problem of determining whether a given irreducible representation of the finite general linear group appears with nonzero multiplicity in a given degenerate Gel'fand-Graev representation, with their partition parameters as input, is NPNP-complete.

Keywords

Cite

@article{arxiv.1506.07022,
  title  = {Kostka multiplicity one for multipartitions},
  author = {James Janopaul-Naylor and C. Ryan Vinroot},
  journal= {arXiv preprint arXiv:1506.07022},
  year   = {2015}
}

Comments

24 pages

R2 v1 2026-06-22T09:58:39.939Z