Geometric Complexity III: on deciding positivity of Littlewood-Richardson coefficients

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We point out that the remarkable Knutson and Tao Saturation Theorem and polynomial time algorithms for LP have together an important and immediate consequence in Geometric Complexity Theory. The problem of deciding positivity of Littlewood-Richardson coefficients for GLn(C) belongs to P. Furthermore, the algorithm is strongly polynomial. The main goal of this article is to explain the significance of this result in the context of Geometric Complexity Theory. Furthermore, it is also conjectured that an analogous result holds for arbitrary symmetrizable Kac-Moody algebras.
10 pages

Keywords

Computational Complexity, Representation Theory, F1.3

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/32582

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0501076
 http://arxiv.org/abs/cs/0501076

Collections

arXiv