A correction to the paper `A new approach to the representation theory of the symmetric groups, III'

TL;DR

This paper provides a corrected bijective proof of Vershik's relations for Kostka numbers using insertion algorithms, enhancing the combinatorial understanding of symmetric group representations.

Contribution

It offers a corrected and detailed combinatorial proof of Vershik's relations, improving upon previous inaccuracies in the literature.

Findings

Corrected bijective proof of Vershik's relations

Application of insertion algorithms in representation theory

Enhanced combinatorial understanding of Kostka numbers

Abstract

The aim of this paper is to give a corrected bijective proof of Vershik's relations for the Kostka numbers. Our proof uses insertion and reverse insertion algorithms, as in the combinatorial proof of the Pieri rule.