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

@article{Mulmuley2005GeometricCI,
  title={Geometric Complexity III: on deciding positivity of Littlewood-Richardson coefficients},
  author={Ketan Mulmuley and Milind A. Sohoni},
  journal={CoRR},
  year={2005},
  volume={abs/cs/0501076}
}
We point out that the remarkable Knutson and Tao Saturation Theorem [9] and polynomial time algorithms for linear programming [14] have together an important, immediate consequence in geometric complexity theory [15, 16]: The problem of deciding positivity of Littlewood-Richardson coefficients belongs to P ; cf.[10]. Specifically, for GLn(C), positivity of a Littlewood-Richardson coefficient cα,β,γ can be decided in time that is polynomial in n and the bit lengths of the specifications of the… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS