Littlewood-Richardson coefficients as a signed sum of Kostka numbers
From MaRDI portal
Publication:6417784
arXiv2211.10669MaRDI QIDQ6417784FDOQ6417784
Authors: Sagar Shrivastava
Publication date: 19 November 2022
Abstract: Littlewood-Richardson (LR) coefficients and Kostka Numbers appear in representation theory and combinatorics related to . It is known that Kostka numbers can be represented as special Littlewood-Rischardson coefficient. In this paper, we show how one can represent LR coefficient as a signed sum of Kostka numbers, and use the formulation to give a polynomial time algorithm for the same, hence showing that they belong to the same class of decision problems. As a corollary, we will prove Steinberg's formula using Kostant's partition function.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial aspects of representation theory (05E10) Representations of Lie algebras and Lie superalgebras, algebraic theory (weights) (17B10)
This page was built for publication: Littlewood-Richardson coefficients as a signed sum of Kostka numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6417784)