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 . In this note λ and µ are partitions of n, n goes to infinity, and 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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
A. Berele and A. Regev, Hook Young diagrams with applications to combinatorics and to representations of Lie superalgebras, Advances in Mathematics 64 (1987), 118–175.
S. Chowla, I. N. Herstein and W. K. Moore, On recursions connected with symmetric groups, Canadian Journal of Mathematics 3 (1951), 328–334.
Y. Dvir, On the Kronecker product of Sn characters, Journal of Algebra 154 (1993), 125–140.
A. Garsia and J. Remmel, Shuffles of permutations and the Kronecker product, Graphs and Combinatorics 1 (1985), 217–263.
G. D. James and A. Kerber, The Representation Theory of the Symmetric Group, Encyclopedia of Mathematics and its Applications, Vol. 16, Cambridge University Press, 1981.
B. F. Logan and L. A. Shepp, A variational problem for random Young tableaux, Advances in Mathematics 26 (1977), 206–222.
I. G. Macdonald, Symmetric Functions and Hall Polynomials, Second edition, Oxford Mathematical Monographs, Oxford University Press, 1995.
A. Regev, Asymptotic values for degrees associated with strips of Young diagrams, Advances in Mathematics 41 (1981), 115–136.
R. P. Stanley, Enumerative Combinatorics, Vol. 2, Cambridge University Press, 1999.
A. M. Vershik and S. V. Kerov, Asymptotic behavior of the maximum and generic dimensions of irreducible representations of the symmetric group, (Russian) Funkt. Anal. i Prilozhen. 19 (1985), no, 1, 25–36; English translation: Functional Analysis and Its Applications 19 (1985), 21–31.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Regev, A. Kronecker multiplicities in the (k, ℓ) hook are polynomially bounded. Isr. J. Math. 200, 39–48 (2014). https://doi.org/10.1007/s11856-014-0005-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11856-014-0005-7