Title: Vanishing of Littlewood-Richardson polynomials is in P,
Abstract: J. DeLoera-T. McAllister and K. D. Mulmuley-H. Narayanan-M. Sohoni
independently proved that determining the vanishing of Littlewood-Richardson
coefficients has strongly polynomial time computational complexity. Viewing
these as Schubert calculus numbers, we prove the generalization to the
Littlewood-Richardson polynomials that control equivariant cohomology of
Grassmannians. We construct a polytope using the edge-labeled tableau rule of
H. Thomas-A. Yong. Our proof then combines a saturation theorem of D.
Anderson-E. Richmond-A. Yong, a reading order independence property, and E.
Tardos' algorithm for combinatorial linear programming.