Border Ranks of Monomials

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Oeding, Luke
Format: Preprint
Veröffentlicht: 2016
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866913431525785600
author Oeding, Luke
author_facet Oeding, Luke
contents Young flattenings, introduced by Landsberg and Ottaviani, give determinantal equations for secant varieties and their non-vanishing provides lower bounds for border ranks of tensors and in particular polynomials. We study monomial-optimal shapes for Young flattenings, which exhibit the limits of the Young flattening method. In particular, they provide the best possible lower bound for large classes of monomials including all monomials up to degree 6, monomials in 3 variables, and any power of the product of variables. On the other hand, for degree 7 and higher there are monomials for which no Young flattening can give a lower bound that matches the conjecturally tight upper bound of Landsberg and Teitler.
format Preprint
id arxiv_https___arxiv_org_abs_1608_02530
institution arXiv
publishDate 2016
record_format arxiv
spellingShingle Border Ranks of Monomials
Oeding, Luke
Algebraic Geometry
Computational Complexity
14M12, 15A69
Young flattenings, introduced by Landsberg and Ottaviani, give determinantal equations for secant varieties and their non-vanishing provides lower bounds for border ranks of tensors and in particular polynomials. We study monomial-optimal shapes for Young flattenings, which exhibit the limits of the Young flattening method. In particular, they provide the best possible lower bound for large classes of monomials including all monomials up to degree 6, monomials in 3 variables, and any power of the product of variables. On the other hand, for degree 7 and higher there are monomials for which no Young flattening can give a lower bound that matches the conjecturally tight upper bound of Landsberg and Teitler.
title Border Ranks of Monomials
topic Algebraic Geometry
Computational Complexity
14M12, 15A69
url https://arxiv.org/abs/1608.02530