Explicit Polynomial Sequences with Maximal Spaces of Partial Derivatives and a Question of K. Mulmuley
Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Standard
Explicit Polynomial Sequences with Maximal Spaces of Partial Derivatives and a Question of K. Mulmuley. / Gesmundo, Fulvio; Landsberg, Joseph M.
I: Theory of Computing, Bind 15, 3, 2019.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - JOUR
T1 - Explicit Polynomial Sequences with Maximal Spaces of Partial Derivatives and a Question of K. Mulmuley
AU - Gesmundo, Fulvio
AU - Landsberg, Joseph M.
PY - 2019
Y1 - 2019
N2 - We answer a question of K. Mulmuley. Efremenko et al. (Math. Comp., 2018) have shown that the method of shifted partial derivatives cannot be used to separate the padded permanent from the determinant. Mulmuley asked if this “no-go” result could be extended to a model without padding. We prove this is indeed the case using the iterated matrix multiplication polynomial. We also provide several examples of polynomials with maximal space of partial derivatives, including the complete symmetric polynomials. We apply Koszul flattenings to these polynomials to have the first explicit sequence of polynomials with symmetric border rank lower bounds higher than the bounds attainable via partial derivatives.
AB - We answer a question of K. Mulmuley. Efremenko et al. (Math. Comp., 2018) have shown that the method of shifted partial derivatives cannot be used to separate the padded permanent from the determinant. Mulmuley asked if this “no-go” result could be extended to a model without padding. We prove this is indeed the case using the iterated matrix multiplication polynomial. We also provide several examples of polynomials with maximal space of partial derivatives, including the complete symmetric polynomials. We apply Koszul flattenings to these polynomials to have the first explicit sequence of polynomials with symmetric border rank lower bounds higher than the bounds attainable via partial derivatives.
U2 - 10.4086/toc.2019.v015a003
DO - 10.4086/toc.2019.v015a003
M3 - Journal article
VL - 15
JO - Theory of Computing
JF - Theory of Computing
SN - 1557-2862
M1 - 3
ER -
ID: 231712793