On (almost) extreme components in Kronecker products of characters of the symmetric groups
classification
🧮 math.CO
math.RT
keywords
componentskroneckerproductsalmostcharactersgroupsmaximalsymmetric
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.