Geometric Complexity Theory (continued)
Dr. K.V. Subrahmanyam
Chennai Mathematical Institute.
12-09-07

---

Abstract

I will motivate Saturated integer programming, and discuss evidence which seems to indicate that computing non-zeroness of the Kronecker coefficient will be in P. The mathematical positivity hypothesis on which this is based will be discussed. The outline to implement the flip, as suggested by Ketan Mulmuley, will then be discussed.