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

Simple item page
dc.creatorMulmuley, Ketan D.
dc.creatorSohoni, Milind
dc.date2005-01-26
dc.date.accessioned2026-07-07T03:22:24Z
dc.date.available2026-07-07T03:22:24Z
dc.descriptionWe 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.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/cs/0501076
dc.identifierhttp://arxiv.org/abs/cs/0501076
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32582
dc.subjectComputational Complexity
dc.subjectRepresentation Theory
dc.subjectF1.3
dc.titleGeometric Complexity III: on deciding positivity of Littlewood-Richardson coefficients
dc.typetext

Files

Collections

arXiv