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

Abstract: The problem of decomposing the Kronecker product of

S_{n}

characters is one of the last major open problems in the ordinary representation theory of the symmetric group

S_{n}

. Here we prove upper and lower polynomial bounds for the multiplicities of the Kronecker product

c h i^{l} m o t i m e s c h i^{m} u

, where for some fixed

k

and

e l l

both partitions

l m

and

m u

are in the

(k, e l l)

hook,

l m

and

m u

are partitions of

n

, and

n

goes to infinity.

Recommendations

Cites work

Cited in

(6)

This page was built for publication: Kronecker multiplicities in the \((k,\ell)\) hook are polynomially bounded.