DeepAI
Log In Sign Up

Vanishing of Littlewood-Richardson polynomials is in P

08/14/2017
by   Anshul Adve, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/09/2017

Tropicalization, symmetric polynomials, and complexity

D. Grigoriev-G. Koshevoy recently proved that tropical Schur polynomials...
04/12/2019

Sylvester-Gallai type theorems for quadratic polynomials

We prove Sylvester-Gallai type theorems for quadratic polynomials. Speci...
03/11/2020

A generalized Sylvester-Gallai type theorem for quadratic polynomials

In this work we prove a version of the Sylvester-Gallai theorem for quad...
03/03/2021

Incidence geometry in the projective plane via almost-principal minors of symmetric matrices

We present an encoding of a polynomial system into vanishing and non-van...
06/28/2021

Computing Characteristic Polynomials of p-Curvatures in Average Polynomial Time

We design a fast algorithm that computes, for a given linear differentia...
01/12/2019

The range of non-linear natural polynomials cannot be context-free

Suppose that some polynomial f with rational coefficients takes only nat...
11/26/2017

Approximating the Permanent of a Random Matrix with Vanishing Mean

Building upon a recent approach pioneered by Barvinok [4, 5, 7, 8] we pr...