On (almost) extreme components in Kronecker products of characters of the symmetric groups
arXiv:1105.3170 · doi:10.1016/j.jalgebra.2014.01.035
Abstract
Using a recursion formula due to Dvir, we obtain information on maximal and almost maximal components in Kronecker products of characters of the symmetric groups. This is applied to confirm a conjecture made by Bessenrodt and Kleshchev in 1999, which classifies all such Kronecker products with only three or four components.
38 pages, new theorems added, and paper now focused on maximal and almost maximal components in Kronecker products