Kronecker multiplicities in the (k,) hook are polynomially bounded

Abstract

The problem of decomposing the Kronecker product of Sn characters is one of the last major open problems in the ordinary representation theory of the symmetric group Sn. Here we prove upper and lower polynomial bounds for the multiplicities of the Kronecker product ^μ, where for some fixed k and both partitions and μ are in the (k,) hook, and μ are partitions of n, and n goes to infinity.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…