Nearby in the stack

On (almost) extreme components in Kronecker products of characters of the symmetric groups · arXivDesk

1105.3170May 16, 201138 pages, new theorems added, and paper now focused on maximal and almost maximal components in Kronecker products

On (almost) extreme components in Kronecker products of characters of the symmetric groups

Christine Bessenrodt, Stephanie van Willigenburg

Combinatorics Representation Theory

arXiv PDF

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.

Briefing

What this paper is actually doing

This is a heuristic sketch from the abstract. Sign in for a live briefing.

GraduateNovelty 3/5

Researchers working in math.CO and adjacent areas.

Claims

The paper addresses: On (almost) extreme components in Kronecker products of characters of the symmetric groups.
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.

Methods

Method details are not extracted without an AI key — open the PDF or HTML version.
Author comment: 38 pages, new theorems added, and paper now focused on maximal and almost maximal components in Kronecker products