Littlewood-Richardson semigroups
Andrei Zelevinsky
Abstract
This note is an extended abstract of my talk at the workshop on Representation Theory and Symmetric Functions, MSRI, April 14, 1997. We discuss the problem of finding an explicit description of the semigroup LRr of triples of partitions of length ≤ r such that the corresponding Littlewood-Richardson coefficient is non-zero. After discussing the history of the problem and previously known results, we suggest a new approach based on the ``polyhedral'' combinatorial expressions for the Littlewood-Richardson coefficients.
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell